A Fast Algorithm for ωP in the Elliptic Curve Cryptosystem
Cheng Zhong · Computer Engineering and Science · 2004
This paper analyses some published fast algorithms for the point multiplication on elliptic curves. We define the factorial expansions of an integer, and present a new fast algorithm for point multiplication on elliptic curves using factorial expansions. Comparing with the binary method, our algorithm gets a 11 % decrease of the number of double points, and attains a considerable decrease of the number of add points for a large integer of 200 bits.