The GHS attack revisited

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

Volumn 2656, Issue , 2003, Pages 374-387

  Hess, Florian ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CHARACTERISTIC POLYNOMIALS; ELLIPTIC CURVE; WEIL DESCENTS;

GEOMETRY;

EID: 35248867395     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_23     Document Type: Article

References (22)

1. S. Arita. Weil descent of elliptic curves over finite fields of characteristic three. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, LNCS 1976, pages 248-258, Kyoto, 2000. Springer-Verlag, Berlin-Heidelberg-New York.
2. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. LMS Lecture Notes Series 265. Cambridge University Press, Cambridge, 1999.
3. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Advances in Cryptology - CRYPTO 2001, LNCS 2139, pages 213-229. Springer-Verlag, Berlin-Heidelberg-New York, 2001.
4. C. Pandu Rangan and C. Ding, editors. Progress in Cryptology - INDOCRYPT 2001, LNCS 2247, Chennai, India, 2001. Springer-Verlag, Berlin-Heidelberg-New York.
5. M. Ciet, J.-J. Quisquater, and F. Sica. A secure family of composite finite fields suitable for fast implementation of elliptic curve cryptography. In C. Pandu Rangan and C. Ding [4], pages 108-116.
6. C. Diem. The GHS-attack in odd characteristic. submitted, 2002.
7. G. Frey. How to disguise an elliptic curve. Talk at ECC' 98, Waterloo, 1998.
8. G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp., 62:865-874, 1994.
9. S. Galbraith. Weil descent of Jacobians. In D. Augot and C. Carlet, editors, WCC2001 international workshop on coding and cryptography, Electron. Notes Discrete Math. 6, Paris, 2001. Elsevier, Amsterdam.
10. S. Galbraith, F. Hess, and N. P. Smart. Extending the GHS Weil descent attack. In L. R. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, LNCS 2332, pages 29-44, Amsterdam, 2002. Springer-Verlag, Berlin-Heidelberg-New York.
11. S. Galbraith and N. P. Smart. A cryptographic application of Weil descent. In M. Walker, editor, Cryptography and Coding, LNCS 1746, pages 191-200, Cirencester, 1999. Springer-Verlag, Berlin-Heidelberg-New York.
12. P. Gaudry, F. Hess, and N. P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. J. Cryptology, 15(1):19-46, 2002.
13. F. Hess. Extending the GHS Weil descent attack. Talk at ECC' 01, Waterloo, 2001.
14. F. Hess. Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symbolic Comp., 33(4):425-445, 2002.
15. F. Hess. Computing relations in divisor class groups of algebraic curves over finite fields. Preprint, 2003.
16. IETF. The Oakley key determination protocol. IETF RFC 2412, 1998.
17. M. Jacobson, A. Menezes, and A. Stein. Solving elliptic curve discrete logarithm problems using Weil descent. J. Ramanujan Math. Soc., 16(3):231-260, 2001.
18. M. Maurer, A. Menezes, and E. Teske. Analysis of the GHS Weil descent attack on the ECDLP over characteristic two finite fields of composite degree. In C. Pandu Rangan and C. Ding [4], pages 195-213.
19. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Info. Th., 39:1639-1646, 1993.
20. A. Menezes and M. Qu. Analysis of the Weil descent attack of Gaudry, Hess and Smart. In D. Naccache, editor, Progress in Cryptology - CT-RSA 2001, LNCS 2020, pages 308-318, San Francisco, 2001. Springer-Verlag, Berlin-Heidelberg-New York.
21. J. Neukirch. Algebraic Number Theory. Springer-Verlag, Berlin-Heidelberg-New York, 1999.
22. N. P. Smart. How secure are elliptic curves over composite extension fields? In B. Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, LNCS 2045, pages 30-39, Innsbruck, 2001. Springer-Verlag, Berlin-Heidelberg-New York.