Improvement Schemes for Scalar Multiplication Algorithm in Elliptic Curve Cryptography
Yupu Hu · Jisuanji gongcheng · 2006
This paper presents a new fast scalar multiplication algorithm on elliptic curve cryptography.This algorithm greatly reduces times of addition operation which takes time for scalar multiplication algorithm by introducing signed and unsigned sliding window coding methods.By theoretic analysis and experiment,signed sliding window coding method is better than NAF algorithm and unsigned sliding window coding method,and it is also able to improve the efficiency of scalar multiplication algorithm compared with accustomed algorithm.And the optimal sliding window width is given.