A General Algorithm for Direct Computation of 2~kP on Elliptic Curre
Zhu Yue · Journal of Information Engineering University · 2003
The authors introduce an efficient algorithm for scalar multiplication on elliptic curves defined overa general field. The algorithms computes 2kP directly from P, without computing the intermediate points,where P is a random point on an elliptic curve. The algorithm is faster than k repeated doublings. The algorithm can induce the algorithms of and in the specify condition. Moreover, the authors apply the algorithm to Montgomery form of elliptic curve which was never presented before.