Extended double-base number system algorithm on elliptic curve scalar multiplication
Niu Rong-jian · Computer Engineering and Applications Journal · 2011
The performance of elliptic curve cryptosystems has heavily depended on the efficient computation of scalar multiplication.Based on the traditional double-base chain representation of scalar using bases 2 and 3.This paper develops a new double-base chain scalar multiplication algorithm with power of 2 and 5.Compared with the standard algorithm,the experimental results show the method has greatly relieved the burden of precomputation and saved the space of memory,which makes it possible for its application to the fields with small space of memory requirement such as IP card and IC card etc.