论文部分内容阅读
研究了“基于椭圆曲线的不可否认数字签名方案”这样一篇会议论文,给出了新的签名和验证方程,降低了原方案的时间复杂性,改进的算法具有更高的效率和安全性。
A conference paper named “Undeniable Digital Signature Scheme Based on Elliptic Curve” is studied. The new signature and verification equations are given, which reduces the time complexity of the original scheme. The improved algorithm is more efficient and safer.