On the Efficient Generation of Elliptic Curves over Prime Fields-Reference-Cited by-同舟云学术

On the Efficient Generation of Elliptic Curves over Prime Fields

Published:2003 Issue: Volume: Page:333-348
ISSN:0302-9743
Container-title:Cryptographic Hardware and Embedded Systems - CHES 2002
language:
Short-container-title:

Author:

Konstantinou Elisavet,Stamatiou Yiannis C.,Zaroliagis Christos

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36400-5_25

Reference24 articles.

1. A. O. L. Atkin, F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61(1993), pp. 29–67.

2. E. R. Berlekamp, Factoring polynomials over large finite fields, Mathematics of Computation 24(1970), pp. 713–735.

3. H. Baier, and J. Buchmann, Efficient construction of cryptographically strong elliptic curves, in Progress in Cryptology-INDOCRYPT 2000, Lecture Notes in Computer Science Vol. 1977 (Springer-Verlag, 2000), pp. 191–202.

4. Ian Blake, Gadiel Seroussi, and Nigel Smart, Elliptic curves in cryptography, London Mathematical Society Lecture Note Series 265, Cambridge University Press, 1999.

5. D. Burton, Elementary Number Theory, McGraw Hill, 4th edition, 1998.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Isomorphic transformations of an elliptic curve over a finite field;Cybernetics and Systems Analysis;2013-05

2. Lower Bounds for Interpolating Polynomials for Square Roots of the Elliptic Curve Discrete Logarithm;Communications in Computer and Information Science;2011

3. On the Efficient Generation of Prime-Order Elliptic Curves;Journal of Cryptology;2009-03-31

4. Efficient generation of secure elliptic curves;International Journal of Information Security;2006-11-29

5. Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations;Lecture Notes in Computer Science;2005