基于滑动窗的标量乘算法改进

Improvement of Scalar Multiplication Algorithm Based on Sliding Window

点标量乘法是椭圆曲线密码体制中最耗时的运算,点标量乘法的效率决定了椭圆曲线加密效率。如何优化改进点标量乘算法成为椭圆曲线密码学的研究热点。如何构造最短加法链是点标量乘的一个研究方向。该文在传统的NAF窗口算法的基础上,给出了改进的基于滑动窗的新标量乘算法,新算法在不增加存储量的同时提高了效率。

The most time-consuming operation of the ECC is the elliptic curve point scalar multiplication.The efficiency of point scalar multiplication determines the efficiency of elliptic curve encryption.How to optimize and improve the algorithm of point scalar multiplication has become the research hot spot of elliptic curve cryptography.How to construct the shortest addition chains is one research direction of point scalar multiplication.This paper proposes a new sliding window algorithm based on the traditional NAF window method.The new algorithm improves the efficiency without any increase in storage capacity at the same time.