Elliptic curves of prime order over optimal extension fields for use in cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2247, Issue , 2001, Pages 99-107

  Baier, Harald ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Complex multiplication; Cryptography; Elliptic curve; Optimal extension field

Indexed keywords

GEOMETRY; LARGE SCALE SYSTEMS;

CARDINALITIES; COMPLEX MULTIPLICATION; ELLIPTIC CURVE; OPTIMAL EXTENSION FIELD; PRIME ORDERS; RUNNING TIME;

CRYPTOGRAPHY;

EID: 84974710254     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45311-3_10     Document Type: Conference Paper

References (14)

1. A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation, 61: 29-67, 1993.
2. H. Baier. Efficient Computation of Singular Moduli with Application in Cryptography. In Fundamentals of Computing Theory, Proceedings of FCT 2001, LNCS 2138, pages 71-82, Berlin, 2001. Springer-Verlag.
3. H. Baier. Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography. Technical Report, Darmstadt University of Technology, 2001. Technical Report No. TI-11/01.
4. H. Baier and J. Buchmann. Efficient Construction of Cryptographically Strong Elliptic Curves. In Progress in Cryptology - INDOCRYPT2000, LNCS 1977, pages 191-202, Berlin, 2000. Springer-Verlag.
5. D. Bailey and C. Paar. Optimal Extension Fields for fast Arithmetic in Public-Key Algorithms. In Advances in Cryptology - CRYPTO’98, LNCS 1462, pages 472-485, Berlin, 1998. Springer-Verlag.
6. D. Bailey and C. Paar. Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography. Journal of Cryptology, 2001. to appear.
7. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
8. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, 1995.
9. M. Fouquet, P. Gaudry, and R. Harley. Finding Secure Curves with the Satoh-FGH Algorithm and an Eary-Abort Strategy. In Proceedings of Eurocrypt 2001, LNCS 2045, pages 14-29, Berlin, 2001. Springer-Verlag.
10. P. Gaudry, F. Hess, and N.P. Smart. Constructive and descructive facets of Weil descent on elliptic curves. Journal of Cryptology, 2001. to appear.
11. N. Koblitz. Elliptic Curve Cryptosystems. Mathematics of Computation, 48: 203-209, 1987.
12. G.-J. Lay and H.G. Zimmer. Constructing elliptic curves with given group order over large finite fields. In Proceedings of ANTS I, LNCS 877, pages 250-263, 1994.
13. V. Miller. Use of Elliptic Curves in Cryptography. In Proceedings of CRYPTO '85, LNCS 218, pages 417-426, Berlin, 1986. Springer-Verlag.
14. V. Shoup. A new polynomial factorization algorithm and its implementation. Journal of Symbolic Computation, 20: 363-397, 1995.