Fast Scalar Multiplication Based on DBNS
Yin Xin-chun · 2008
Scalar multiplication is the bottleneck of elliptic curve cryptography. A new number field system——double base number system (DBNS) is employed in denoting scalar k. The length of double base chain lies in the range of O(logk/log log k).In field fast algorithm aspect, a fast algorithm of directly computing 3kP is proposed in way of trading reversions for multiplications. The new double base scalar multiplication algorithm is integrated with fast algorithms of direct computing 2kP,2P±Q,3P±Q and 3kP. The efficiency of new algorithm is superior to algorithm given by Dimitrov and traditional scalar multiplication.