论文部分内容阅读
Montgomery方法是椭圆曲线密码中计算多倍点运算 k P的一种新方法。为减少在椭圆曲线数字签名算法验证过程中需完成的 k P+l Q的计算量 ,该文在分析 Mont-gom ery方法的基础上 ,将计算 k P和计算 l Q的流程结合在一起 ,提出了一种计算多倍点运算 k P+l Q的新算法 ,使椭圆曲线数字签名算法中验证签名所需的计算量减少了2 5 %。新算法对改善椭圆曲线密码的实现技术具有一定意义。
The Montgomery method is a new method of calculating kP in the elliptic curve cryptogram. In order to reduce the computational complexity of k P + l Q in the validation of elliptic curve digital signature algorithm, this paper combines the calculation of k P with the calculation of l Q based on the analysis of Mont-gom ery method, A new algorithm for calculating kP + lQ is proposed, which reduces the computational complexity of verifying the signature in elliptic curve digital signature algorithm by 25%. The new algorithm has some significance to improve the realization of elliptic curve cryptography.