Koblitz曲线密码中倍点运算算法的改进

Koblitz曲线密码中倍点运算算法的改进

孙跃刚, 李辉来

吉林大学数学研究所, 长春 130012

收稿日期:2008-08-08 修回日期:1900-01-01 出版日期:2009-03-26 发布日期:2009-03-26
通讯作者: 李辉来

An Improved Method for Computing Multiplying Points on Koblitz Curve Cryptography

SUN Yue gang, LI Hui lai

Institute of Mathematics, Jilin University, Changchun 130012, China

Received:2008-08-08 Revised:1900-01-01 Online:2009-03-26 Published:2009-03-26
Contact: LI Hui lai

摘要/Abstract

摘要： 针对Koblitz曲线密码中最耗时的倍点运算, 提出一种新的递推算法. 算法分析表明, 新算法使倍点运算的效率比常规的逐点法提高55%以上, 从而改善了椭圆曲线密码系统的整体运算速度.

关键词: 椭圆曲线密码, 倍点, Koblitz曲线

Abstract: The authos analyzed the method existed and got an improved implementation method on Koblitz curve cryptograph on computing . The analysis shows that the efficiency was increased by a factor of over 55% and this method can be used to improve the efficiency of elliptic curve cryptography (ECC).

Key words: elliptic curve cryptography, multiplying point, Koblitz curve

中图分类号:

O157.4

孙跃刚, 李辉来. Koblitz曲线密码中倍点运算算法的改进[J]. J4, 2009, 47(02): 286-288.

SUN Yue gang, LI Hui lai. An Improved Method for Computing Multiplying Points on Koblitz Curve Cryptography[J]. J4, 2009, 47(02): 286-288.