期刊文献+

Montgomery形式椭圆曲线的生成研究 被引量:1

Researches on generation of Montgomery form elliptic curve
原文传递
导出
摘要 文章详细分析了O-K-S算法[1],并给出改进算法。改进的算法有效地生成了广义Mersenne素数域上可抵抗时间分析攻击且阶恰好只能被4整除的Montgomery形式椭圆曲线,并且运用了早期终止策略和伪随机选取方法,在一定程度上提高了此类曲线的生成效率。 This paper analyzes the O-K-S algorithm in detail and gives an improved algorithm. The improved algorithm generate a Montgomery-form elliptic curve, whose cofactor is exactly 4 and which can prevent the timing-attack over a Mersenne prime finite field. Furthermore, the early-abort strategy and pseudo-random method are used to effectively improve the generation speed of these elliptic curves.
作者 郭刚 曾国平
出处 《信息安全与通信保密》 2007年第10期85-88,共4页 Information Security and Communications Privacy
关键词 椭圆曲线密码 Montgomery-形式椭圆曲线 广义Mersenne素数 早期终止策略 elliptic curve cryptography montgomery-form elliptic curves generalized mersenne prime early-abort strategy
  • 相关文献

参考文献8

  • 1[1]Kasuyuki Okeya,Hiroyuki Kurumatani,Kouichi Sakurai.Elliptic curves with the Montgomery-Form and Their Cryptographic Applications[J].PKC 2000,LNCS 1751,2000:238~257.
  • 2[2]Montgomery P L.Speeding the Pollard and Elliptic Curve Methods of Factorization[J].Mathematics of Computation,1987,48(177):243~264.
  • 3[3]Toru Akishita.Fast Simultaneous Scalar Multi plication on Elliptic Curve with Montgomery Form.SAC 2001,LNCS2259,2001,255~267
  • 4[4]Koche C P.Timing Attacks on Implementations of Diffie-Hellman,RSA,DSS and Other Systems[C].Advances in Cryptology-CRYPTO'96.LNCS1109,1996,104~113.
  • 5[6]Fouquet M,Gaudry P,Harley R.Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy.In Advances in Cryptoloy-EUROCRYPT'2001,LNCS.Springer Verlag,2001.
  • 6[7]Lercier R.Finding Good Random Elliptic Curves for Cryptosystems Defined over[C].Advances in Cryptoloy-EUROCRYPT'97,LNCS.Springer Verlag,1997.
  • 7[9]张晓磊.椭圆曲线密码中若干问题的研究[D].中国科技大学硕士学位论文,2003.
  • 8殷新春,汪彩梅,陈决伟.有限域上素数阶的安全椭圆曲线的选取及实现[J].计算机应用研究,2006,23(8):95-96. 被引量:2

二级参考文献9

  • 1I Blake, G Seroussi, N Smart. Elliptic Curves in Cryptography [ M ].Cambridge Kingdom: Cambridge University Press, 1999.2-10.
  • 2Certicom Research. SEC 1 : Elliptic Curve Cryptography [ S ]. 2005,1-133.
  • 3R Schoof. Elliptic Curves over Finite Fileds and the Computation of Square Roots mod p[ J]. Mathematics of Computation, 1985,44:483-494.
  • 4R Schoof. Counting Points on Elliptic Curves over Finite Fields[J].Journal of Theorie des Nombres de Bordeaux, 1995, (7) :219-254.
  • 5Elkies N D. Elliptic and Modular Curves over Finite Fields and Related Computational[ A ]. Buell D A, Teitelbaum J T. Computational Perspective on Number Theory [ M ]. AMS/International Press, 1998.21-76.
  • 6Atkine A O. The Number of Points on an Elliptic Curve Modulo a Prime[ Z]. Series of E-mail to the NMBRTHRY Mailing List, 1992.
  • 7T Izu, J Kogure, M Noro, et al. Efficient Implementation of Schoof' s Algorithm[C]. Advances in Cryptology-Asiacrypt' 98, Lecture Notes in Computer Science, Springer-Verlag, 1998.66-79.
  • 8J M Couveignes, L Dewaghe, F Morain. Isogeny Cycles and the SchoofElkies: Atkin Algorithm [ R]. Research Report LIX/RR/96/03, LIX, 1996.
  • 9Elisavet Konstantinou, Yiannis C Stamatiou, Christos Zaroliagis, On the Efficient Generation of Elliptic Curves over Prime Fields [ M ].Springer-Verlag, 2003. 333-348.

共引文献1

同被引文献1

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部