Efficient construction of cryptographically strong elliptic curves

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

Volumn 1977, Issue , 2000, Pages 191-202

  Buchmann, Johannes ^a   Baier, Harald ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Class field theory; Complex multiplication; Cryptography; Elliptic curve; Factoring polynomials; Finite field

Indexed keywords

GEOMETRY;

CLASS NUMBERS; COMPLEX MULTIPLICATION; EFFICIENT CONSTRUCTION; ELLIPTIC CURVE; ENDOMORPHISM RING; FIELD THEORY; FINITE FIELDS; NEGATIVE INTEGERS;

CRYPTOGRAPHY;

EID: 84947763991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44495-5_17     Document Type: Conference Paper

References (15)

1. A.O.L. Atkin and F. Morain. Elliptic curves and primality proving. Mathematics of Computation, 61:29–67, 1993. 191, 192, 194
2. T.M. Apostol. Modular Functions and Dirichlet Series in Number Theory. Springer-Verlag, 1990. 194
3. Geeignete Kryptoalgorithmen gem¨aß § 17(2) SigV, April 2000. Bundesamt f¨ur Sicherheit in der Informationstechnik. 191, 193, 193
4. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999. 194
5. H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, 1995. 198, 199
6. IEEE. P1363 Standard Specifications For Public-Key Cryptography. Available via WWW from http://grouper.ieee.org/groups/1363/.191
7. LiDIA. A library for computational number theory. Technical University of Darmstadt. available via WWW from http://www.informatik.tudarmstadt.de/TI/LiDIA/Welcome.html.199
8. 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. 191, 192, 199
9. A. Menezes, T. Okamoto, and S. Vanstone. Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. In Proceedings of the 23rd Annual ACM Symposium on the Theory of Computing, pages 80–89, 1991. 193
10. V. Muller and S. Paulus. On the Generation of Cryptographically Strong Elliptic Curves. Technical Report, Technical University of Darmstadt, 1997. 191
11. V. Shoup. A new polynomial factorization algorithm and its implementation. Journal of Symbolic Computation, 20:363–397, 1995. 199
12. N.P. Smart. The Discrete Logarithm Problem on Elliptic Curves of Trace One. Journal of Cryptology, 12/3:193–196, 1999. 193
13. P C van Oorschot and M J Wiener. Parallel Collision Search with Cryptanalytic Applications. Journal of Cryptology, 12/1:1–28, 1999. 193
14. H. Weber. Lehrbuch der Algebra III. Chelsea Publishing Company, 1902.198
15. D Yui and D Zagier. On the singular values of Weber modular functions. Mathematics of Computation, 66:1645–1662, 1997. 192, 197