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

An Improved Method for Computing Multiplying Points on Koblitz Curve Cryptography

作　　者：孙跃刚[1] 李辉来[1] 

机构地区：[1]吉林大学数学研究所,长春130012

出　　处：《吉林大学学报（理学版）》2009年第2期286-288,共3页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:10371050)

摘　　要：针对Koblitz曲线密码中最耗时的倍点运算,提出一种新的递推算法.算法分析表明,新算法使倍点运算的效率比常规的逐点法提高55%以上,从而改善了椭圆曲线密码系统的整体运算速度.The authos analyzed the method existed and got an improved implementation curve cryptograph on computing kP. The analysis shows that the efficiency was increased 55% and this method can be used to improve the efficiency of elliptic curve cryptography method on Koblitz by a factor of over （ECC）.

关 键 词：椭圆曲线密码 倍点 KOBLITZ曲线 

分 类 号：O157.4[理学—数学]