基于边信道原子的椭圆曲线标量乘算法

›› 2012, Vol. 25 ›› Issue (4): 16-.

基于边信道原子的椭圆曲线标量乘算法

王宏,朱峰

(西安通信学院二系,陕西西安 710106)

出版日期:2012-04-15 发布日期:2012-04-17
作者简介:王宏(1979—),男,硕士。研究方向:信息安全。

Research on Algorithm for Elliptic Curve Scalar Multiplication Based on Side-Channel Atomicity

WANG Hong, ZHU Feng

(No.2 Department,Xi'an Communication Institute,Xi'an 710106,China)

Online:2012-04-15 Published:2012-04-17

摘要/Abstract

摘要：

提出了一种能够抵抗简单能量分析攻击的边信道原子结构,减少了椭圆曲线密码体制中标量乘的倍点和点加运算次数,从而节省了运算时间,最后通过调用Crypto++库函数,对于NIST提供的160 bit素域上椭圆曲线编程实现算法,发现此算法的效率比Montgomery Ladder算法提高了37.6%。

关键词: 椭圆曲线密码, 标量乘, 边信道攻击, 边信道原子

Abstract:

This article brings forward an SPA(Simple Power Analysis)-resisting side-channel atomicity that can reduce the frequency of point doubling and point addition thus saving computation time.By exploiting Crypto++ Library we implement our scalar multiplication algorithm for elliptic curve based in 160 bit prime field given by NIST and find that our algorithm is 37.6% faster than Montgomery Ladder algorithm.

Key words: elliptic curve cryptography;scalar multiplication;side-channel attack;side-channel atomicity

中图分类号:

TP301.6

王宏, 朱峰. 基于边信道原子的椭圆曲线标量乘算法[J]. , 2012, 25(4): 16-.

WANG Hong, ZHU Feng. Research on Algorithm for Elliptic Curve Scalar Multiplication Based on Side-Channel Atomicity[J]. , 2012, 25(4): 16-.

参考文献

［1］NEAL K.The state of elliptic curve cryptography［J］.Designs,Codes and Cryptography,2000(19).173-193.

［2］MILLER V.Use of elliptic curves in cryptography［C］.Springer-Verlag,Berlin:Proc.of CRYPTOl985,LNCS 2 1 8,PP.417-426,1986.

［3］ROBERTO A,CHRISTOPHE D,TANJA L.Handbook of elliptic and hyperel-liptic curve crytography［M］.USA:Chapman&Hall/CRC,2006.

［4］王育民,刘建伟.通信网的安全-理论与技术［M］.西安:西安电子科技大学版社,1999.

［5］石润华,钟诚.一种快速的椭圆曲线标量乘方法［J］.计算机工程与应用,2006(2):85-90.

［6］COATES J,GREENBERG R.Arithmetic thery of elliptic curves［C］.The 3rd Session of the Centro Intemazionate Matematico Estivo,1997,90:12-19.

［7］OGUZ Y.Scalar multiplication on elliptic curves［D］.Orlando:Middle East Technical University,2006.

［8］ANDREAS E.Elliptic curves and their applications to cryptography［M］.UK:Kluwer Academic Publishers,1999.

［9］张宁.椭圆曲线上点的标量乘法［D］.西安:西安电子科技大学,2005.

［10］CHEVALLIER M B,CIET M,JOYE M.Low-cost solutions for preventing simple side-channel analysis:side-channel atomicity［J］.IEEE Trans.Computers,2004,53(6):760-768.

［11］JEAN S C.Resistance against differentinl power analysis for elliptic curve cryptosystems［C］.Springer-Verlag:Cryptographic Hardware and Embedded Systems(cHES99),Lecture Notes in Computer Science,1999,1707:292-302.

［12］HENRI C,ATSUKO M,TAKATOSHI O.Efficient elliptic curve exponentiation using mixed coordinates［C］.Asia CRYPT98,LNCS 1514,1998:51-65.

［13］刘双根.快速安全的椭圆曲线标量乘算法研究［D］.西安:西安电子科技大学,2008.

［14］秦宝东,孔凡玉.基于边带信道原子的安全快速椭圆曲线密码点乘算法［J］.计算机应用,2009,29(11):2983-2986.

［15］MARC J,SUNG M Y.The montgomery powering ladder［C］.Springer-Varlag:Cryptographic Hardware and Embedded Systems-CHES,Lecture Notes in Computer Science,2003,2523:291-302.

[1]	严琳,卢忱. 基于快速标量乘算法的椭圆曲线数字签名方案[J]. , 2014, 27(4): 23-.
[2]	尹灿, 卢忱. Koblitz曲线上改进的ECDSA算法[J]. , 2011, 24(2): 79-.