Fast Algorithm for Scalar Multiplication in Elliptic Curve Cryptography

Some fast algorithms for scalar multiplication on elliptic curves are put forward and their characteristics analyzed. In order to get over the shortage of non-adjacent form (NAF) method, a new improved NAF window method introduced. Compared to other methods, this improved method significantly reduces the number of point-additions and the number of point-doublings in scalar multiplication, and the efficiency of computation found to be increased by 25%.