【摘要】 椭圆曲线密码体制中加、解密速度提高的关键在于加速椭圆曲线上点乘运算的效率。基本的方式之一是缩短大数的二进制序列长度,将其二进制序列划分为若干个“窗口”,构造一新的等价的2k进制序列。在讨论了对应不同长度的二进制序列转换成2k进制序列后,确立“窗口”长度k值的最佳选取,使得在这种选取下椭圆曲线上点乘运算的效率最高。更多还原

【Abstract】 To improve rate of encryption and decryption in the elliptic curve cryptosystems, the key is key to calculate fast for the point multiplication. A basic form is to shrink the length of the 2 sequence representation of a number, and 2k sequence representation is consisted of dividing some "windows" in the 2 sequence representation. When the 2 sequence representation is changed, the 2k sequence representation, the optimum length of the windows for k is presented, so the best of all efficiency of the algorithm can be obtained.更多还原