Extending the GHS weil descent attack

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

Volumn 2332, Issue , 2002, Pages 29-44

  Galbraith, Steven D ^a   Hess, Florian ^b   Smart, Nigel P ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; PUBLIC KEY CRYPTOGRAPHY;

DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; GHS WEIL DESCENT ATTACK; WEIL DESCENTS;

CURVE FITTING;

EID: 84947261826     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_3     Document Type: Conference Paper

References (19)

1. IETF. The Oakley Key Determination Protocol. IETF RFC 2412, Nov 1998.
2. D.J. Bernstein. Bounds on Ψ(x, y). http://cr.yp.to/psibound.html.
3. I.F. Blake, G. Seroussi and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
4. H. Cohen, A course in computational number theory. Springer GTM 138 1993.
5. J.-M. Couveignes. Computing l-isogenies using the p-torsion. Algorithmic Number Theory Symposium- ANTS II, Springer-Verlag LNCS 1122, 59–65, 1996.
6. G. Frey. How to disguise an elliptic curve. Talk at ECC’ 98, Waterloo.
7. G. Frey and H. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp., 62, 865–874, 1994.
8. S.D. Galbraith. Constructing isogenies between elliptic curves over finite fields. LMS J. Comput. Math., 2, 118–138, 1999.
9. S.D. Galbraith and N.P. Smart. A Cryptographic application of Weil descent. Codes and Cryptography, Springer-Verlag LNCS 1746, 191–200, 1999.
10. P. Gaudry, F. Hess and N.P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. J. Cryptology, 15, 19–46, 2002.
11. M. Jacobson, A. Menezes and A. Stein. Solving elliptic curve discrete logarithm problems using Weil descent. J. Ramanujan Math. Soc., 16, No. 3, 231–260, 2001.
12. D. Kohel. Endormorphism rings of elliptic curves over finite fields. Phd Thesis, Berkeley, 1996.
13. R. Lercier. Computing isogenies in F2n. Algorithmic Number Theory Symposium-ANTS II, Springer-Verlag LNCS 1122, 197–212, 1996.
14. A. Menezes, T. Okamoto and S. Vanstone. Reducing elliptic curve logarithms to logarithms in finite fields. IEEE Trans. on Infor. Th., 39, 1639–1646, 1993.
15. A. Menezes and M. Qu. Analysis of the Weil descent attack of Gaudry, Hess and Smart. Topics in Cryptology - CT-RSA 2001, Springer-Verlag LNCS 2020, 308–318, 2001.
16. S. Pohlig and M. Hellman. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. on Infor. Th., 24, 106–110, 1978.
17. J. Pollard. Monte Carlo methods for index computations mod p. Math. Comp., 32, 918–924, 1978.
18. N.P. Smart. How secure are elliptic curves over composite extension fields? EUROCRYPT ’01, Springer-Verlag LNCS 2045, 30–39, 2001.
19. J. Vélu. Isogénies entre courbes elliptiques. Comptes Rendus l’Acad. Sci. Paris, Ser. A, 273, 238-241 1971.