期刊文献+

SEA算法及安全椭圆曲线的有效选取

SEA Algorithm and Efficient Selection of Secure Elliptic Curve
下载PDF
导出
摘要 在椭圆曲线密码体制的实现中 ,首先要选取安全的椭圆曲线 ,选取安全椭圆曲线阶的核心步骤是对椭圆曲线阶的计算 ,SEA算法是计算椭圆曲线的有效算法。本文在实现Fp 上SEA算法的前提下 ,就SEA算法中各方法的综合运用提出了一种方案 ,并且对用SEA算法选取安全椭圆曲线速度上的优化作了一些讨论 ,所获得的一些速度指标和国际公开资料上的指标有可比性。 In the implementation of the Elliptic Curve Cryptosystem, we first have to select a secure elliptic curve. The main step of choosing a secure elliptic curve is the computation of the order of a randomly selected elliptic curve. The SEA algorithm is known as an efficient method to count the orders of elliptic curves. During the implementation of SEA algorithm over GF(p),we provide an efficient scheme of the combination of the methods in the SEA algorithm and discuss how to speed up the selection of a secure elliptic curve. Our implementation of the SEA algorithm and selection of the secure elliptic curve over GF(p) are efficient.
出处 《信息工程大学学报》 2000年第4期1-4,共4页 Journal of Information Engineering University
基金 国家自然科学基金!重点资助项目 (199310 10 )
关键词 安全椭圆曲线 Frobenius映射 SEA算法 ICS 椭圆曲线密码体制 密码学 安全机制 Secure Elliptic Curve Frobenius endomorphism SEAalgorithm ICS
  • 相关文献

参考文献15

  • 1ANSI X9.62-1998:Publie Key Cryptography for the Financial Service Industry: The Elliptic Curve Digital Signature Algorithm(ECDSA) [S].American Bankers Association, 1998.
  • 2ANSI X9.63-199 X:Public Key Cryptography for the Financial Service Industry: Key Agresment and Key Transport Using Elliptic Curve Crytography[S].American Bankers Association, Working Draft. 1999.8.
  • 3IEEE P1363.Standards for Public-Key Cryptography Institute of Electrical and Electronics Engineers [S].Working Draft.1999.7.
  • 4SEC1. Elliptic Curve Crytography, Standarde for Efficient Cryptography Group[S]. Working,Draft,1999.9.
  • 5FIPS 186-2. Digital Signature Standard Federal Information Standard[S] .2000.5.
  • 6R. Schoof. Counting points on elliptic curve over finite fields[J]. J.T. Nombres Bordeaux,1995,7:219-254.
  • 7A O Atkin. The number of point on an elliptic curve modulo a prime[M], preprint, 1988.
  • 8N D Elkies. Explieit isogernies[M], preprint, 1991.
  • 9Jean-Marc Couveignes,F Morain . Schoof' s algorithm and isogeny cycles[J],In Algorithmic Number Theory,SpringerVerlag,LNCS 877, 1994,43-58.
  • 10L Dewaghe, Remarks on the Schoof-Elkies-Atkin Algorithm, Mathematios of Computation[J]. 1998,67:1247- 1252.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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