椭圆曲线数字签名算法中的快速验证算法

Fast verification algorithm in elliptic curve digital signature algorithm

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 for the computation of the multi point arithmetic kP in elliptic curve cryptosystems. A new computational method based on the Montgomery method was developed to reduce the computations for kP+lQ in the verification process of the elliptic curve digital signature algorithm. The algorithm is a combination of two iteration procedures using the Montgomery method for computing both kP and lQ . The computation amount for kP+lQ decreases 25% compared with that for the traditional algorithm. The new algorithm will facilitate the implementation of elliptic curve cryptosystems.