改进伽罗华有限域上的数乘算法

An Improved Scalar-Multiplication Algorithm in Galois Field

  • 摘要: 研究椭圆曲线加密体系中的数乘运算.通过分析数乘运算的特点发现,减少椭圆运算次数可以大幅提高数乘运算速度.针对数乘运算中占比重较大的基点数乘,改进了带符号窗口算法,并设计了权表法.采用改进的数乘算法使得倍运算次数大大减少.通过预计算建立基点的2k权表,改进了基点的带符号窗口算法,并对权表法进行复杂度分析.实验证明,该算法显著提高了椭圆曲线-厄格玛尔算法(EC-ElGamal)加密体系的运算速度.在微机上运行113bit的EC-ElGamal体系,与宽度为4的窗口算法相比,系统加密速度提高了1/3.

     

    Abstract: Studies scalar multiplication algorithms to speed up the elliptic curve cryptosystem. By analyzing features of scalar multiplication, it is found that reducing the number of elliptic operations can lead to a marked speeding up scalar multiplication. For the base point’s scalar multiplication, an important scalar multiplication, the signed window method is improved, and the power table method is designed, to reduce the number of elliptic operations. On the PC, compared to a system with the 4 width signed window method, the speed of a 113 bit EC ElGamal cryptosystem is improved 1/3. Power table method improves the base point’s scalar multiplication, by using the principle of signed window method. With analysis and experiments, it is proved that pwoer table method can remarkably speed up encoding of EC ElGamal cryptosystem.

     

/

返回文章
返回
Baidu
map