Fast verification algorithm in elliptic curve digital signature algorithm
Guoqiang Bai · Journal of Tsinghua University(Science and Technology) · 2003
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.