摘要
简单阐述经典椭圆曲线数字签名(ECDSA)的基本原理,并分析其时间复杂度。在文中列举两种已经改进ECDSA签名算法,同时也分析它们时间复杂度。从椭圆曲线数字签名的安全性和高效性出发,提出一种椭圆曲线数字签名新算法,并证明其理论正确性,讨论其安全性和复杂度。研究结果表明,改进算法在签名和验证过程中避免求逆运算,并且在签名验证过程中也减少一次点乘;具有更少的复杂度,极大提高运算速度。
The classic elliptic curve digital signature algorithm（ECDSA）is described basically,and its time complexity is analyzed.Two kinds of improved ECDSA are paiticularized and their time complexities discussed.We investigate the requirements of application system and efficiency of ECDSA,improve ECDSA,verify the truth of mathematical theories,discuss the security of the improved algorithm and time complexity.The research result shows that it has no need of the improved ECDSA to do the inversion and to cut down one time of scalar multiplication in the verifying process.The improved algorithm has less time complexity,so the operation speed of the improved algorithm system can be boosted very much.
出处
《电子器件》
CAS
2011年第1期89-93,共5页
Chinese Journal of Electron Devices
关键词
椭圆曲线
数字签名
时间复杂度
模逆
点乘
elliptic curve
digital signature
time complexity
modular inversion
Scalar multiplication
