Abstract：A new algorithm based on subset of double-base number system（DBNS） was proposed in order to improve the efficiency of scalar multiplication. The concept of subset of DBNS was described, and storagespaee and precomputation time were decreased from tz2 to 3n -2. A greedy algorithm was deduced to compute the DBNS chain at the same time. The number of 2-integers is smaller, so that the length of DBNS chain becomes a little longer. Mixed-coordinate was used to optimize the algorithm. The new rithm was compared with the traditional fixed-point window algorithm and Dimitrov method, and the resuits show that the new algorithm is more efficient in computation time and storage space than others.
王圆圆, 殷新春. 基于双基数子集表示的快速标量乘算法[J]. 江苏大学学报（自然科学版）, 2009, 30(3): 297-301.
Wang Yuanyuan, Yin Xinchun. Fast scalar multiplication based on subset of double-base number system[J]. Journal of Jiangsu University(Natural Science Eidtion)
, 2009, 30(3): 297-301.
2009, Vol. 30 
