Improved Fast Algorithm of Scalar Multiplication for Fix Base Point
Wang Yu-x · 2013
For the scalar multiplication of a fix base point,the algorithm of LLECC has a good performance in efficiency,however the huge amount of precomputation and storage restrict its application.Through a new arrangement of the coefficient matrix in which the scalar k is recoded in the non-adjacent form based on the window,the storage can be reduced with the sparse property of the encoding method.When the length of the scalar is 160 bit and the window's width is 4 bit,the improved algorithm can reduce 12.4%and 53.3% in the aspect of the computational complexity and storage cost,compared with the original LLECC algorithm.