Improved Sliding Window Scalar Multiplication Algorithm
Hou Hong-xiang · Journal of Chinese Computer Systems · 2008
Scalar multiplication is a bottle-neck in the application of Elliptic Curve Cryptosystem.This paper improves on traditional sliding window algorithm: firstly stores nonzero window value and exponent of nonzero window's power with pretreatment track;secondly proposes a new scalar multiplication algorithm by combining algorithm direct computing 2kR+S in field and pre-compute table.The new algorithm trades several memories for the improvement in evaluation stage.This paper still analyzes that the efficiency of new algorithm in mixed coordinate enhances about 40.6% comparing with traditional sliding window algorithm in affine coordinate when w=4.In addition,new algorithm resists the attack based on side channel at the same time.