基于伪随机数生成器的标量乘改进算法① - 计算机系统应用.pdf

2015 年 第 24 卷 第 1 期 计 算 机 系 统 应 用 基于伪随机数生成器的标量乘改进算法① 李 辉, 刘中华, 易军凯 (北京化工大学 信息科学与技术学院, 北京 100029) 摘 要: 标量乘算法是椭圆曲线密码体制中最基本、最耗时的算法, 包含点加和倍点两种运算. 传统的改进方法 通过改造标量表示形式减少非零元位数来降低标量乘中的点加运算次数. 为了进一步提高标量乘算法效率, 根 据标量的生成方式, 提出了一种结合伪随机数生成器改进算法. 利用斐波那契数列生成器的的循环迭代相加可 以将标量乘运算由反复的点加和倍点运算转化为单一的点加运算. 实验结果表明, 改进算法相比传统的窗口 NAF 算法能够降低 60% 以上的运算量. 关键词: 标量乘; 椭圆曲线密码体制; 点加; 倍点; 伪随机数生成器; 斐波那契数列生成器 Improved Algorithm of Scalar Multiplication Based on Pseudo-Random Number Generator LI Hui, LIU Zhong-Hua, YI Jun-Kai (College of Information Science and Technology, Beijing University of Chemical Technology, Beijing 100029, China) Abstract: Scalar multiplication is the dominant and time consuming algorithm in elliptic curve cryptography, including point addition and point doubling. Traditional improved methods reduced the calculation of point addition by transforming the representation of scalar to reduce the number of non-zero bits. To further improve the efficiency of the scalar multiplication, this paper proposes an improved algorithm combining pseudo-random number generator according to the generation of the scalar. With cyclical iterative addition of lagged Fibonacci generator, scalar multiplication can be transformed into simplex operation of point addition from repetitive point addition and point doubling. Experimental results show that the improved algorithm compared to the traditional window NAF algorithm can reduce more than 60% of the amount of computation. Key words: scalar multiplication; elliptic curve cryptography; point addition; point doubling; pseudo-random number generator; lagged Fibonacci generator 椭圆曲线密码体制(Elliptic Curve Cryptography, ECC 的核心运算标量乘包含两种基本的运算: 点 ECC)是一种基于椭圆曲线上离散对数难题的公钥密 加和倍点运算, 其最基础的算法是二进制算法.