Improvement of scalar multiplication algorithm on elliptic curve over GF(2m)
Chen Wei-hai · Hebei Sheng Kexueyuan xuebao · 2002
This paper describes an algorithm for computing scalar multiplications on non-supersingular elliptic curve defined over GF(2m). This algorithm is an optimized version of Montgomery's method. It requires no precomputed multiples of a point and is faster than the addition-subtraction method described in draft standard IEEE P1363. In addition, it is easy to implement in both hardware and software, requires less memory than projective schemes. Therefore, it is much convenient to implement ECC in restricted environments.