How secure are elliptic curves over composite extension fields?

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

Volumn 2045, Issue , 2001, Pages 30-39

  Smart, Nigel P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

CRYPTOGRAPHIC SYSTEMS; CURRENT TECHNOLOGY; ELLIPTIC CURVE; EXTENSION FIELD; KEY DETERMINATION; WEIL DESCENTS;

CRYPTOGRAPHY;

EID: 84945129506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44987-6_3     Document Type: Conference Paper

References (18)

1. IETF. The Oakley Key Determination Protocol. IETF RFC 2412, Nov 1998.
2. NIST. FIPS PUB 186-2: DIGITAL SIGNATURE STANDARD (DSS). National Institute for Standards and Technology, 2000.
3. SECG. SEC 2: Recommended Elliptic Curve Domain Parameters. Standards for Efficient Cryptography Group, 1999.
4. I.F. Blake, G. Seroussi and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
5. G. Frey. How to disguise an elliptic curve. Talk at Waterloo workshop on the ECDLP, 1998. http://cacr.math.uwaterloo.ca/conferences/1998/ecc98/slides.html
6. S.D. Galbraith and N.P. Smart. A cryptographic application of Weil descent. Cryptography and Coding, 7th IMA Conference, Springer-Verlag, LNCS 1746, 191200, 1999. The full version of the paper is HP Labs Technical Report, HPL-1999-70.
7. P. Gaudry. An algorithm for solving the discrete logarithm problem on hyperelliptic curves. In Advances in Cryptology - EUROCRYPT 2000, Springer-Verlag LNCS 1807, 19-34, 2000.
8. P. Gaudry, F. Hess and N.P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. To appear Journal Cryptology.
9. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48, 203-209, 1987.
10. N. Koblitz. Hyperelliptic cryptosystems. J. Crypto., 1, 139-150, 1989.
11. A. Menezes and M. Qu. Analysis of the Weil Descent Attack of Gaudry, Hess and Smart. To appear Proceedings RSA 2001, 2001.
12. V. Miller. Use of elliptic curves in cryptography. In Advances in Cryptology, CRYPTO - ‘85, Springer LNCS 218, 47-426, 1986.
13. P.C. van Oorschot and M.J. Wiener. Parallel collision search with cryptanalytic applications. J. Crypto., 12, 1-28, 1999.
14. S. Paulus. An algorithm of sub-exponential type computing the class group of quadratic orders over principal ideal domains. In ANTS-2: Algorithmic Number Theory, Springer-Verlag, LNCS 1122, 243-257, 1996.
15. S. Paulus and A. Stein. Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves. In ANTS-3: Algorithmic Number Theory, Springer- Verlag, LNCS 1423, 576-591, 1998.
16. J.M. Pollard. Monte Carlo methods for index computation (mod p). Math. Comp., 32, 918-924, 1978.
17. J. Teitelbaum. Euclid’s algorithm and the Lanczos method over finite fields. Math. Comp., 67, 1665-1678, 1998.
18. D. Weber and T. Denny. The solution of McCurley’s discrete log challenge. In Advances in Cryptology - CRYPTO ‘98, Springer-Verlag LNCS 1462, 458-471, 1998.