Efficient Scalar Multiplication without Precomputation
Peng Dai-yuan · Journal of the China Railway Society · 2012
Scalar multiplication is the fundamental and time-consuming operation in elliptic curve cryptosystems,the performance of the elliptic curve cryptosysytem deeply depends on the efficiency of scalar multiplication.In this paper,the new signed binary scalar representation method of the digit set {-1,0,1},with the minimal Hamming weight,shortest significant length and longer average zero-run length,was presented,and the efficient scalar multiplication algorithm was obtained by using direct computation of the 2kQ+P strategy.The analysis results show that the average calculation time is shortened by 26.1% in comparison to the traditional NAF method.