Constructive and destructive facets of weil descent on elliptic curves

Journal of Cryptology

Volumn 15, Issue 1, 2002, Pages 19-46

  Gaudry, P ^a   Hess, F ^b   Smart, N P ^c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF SYDNEY   (Australia)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Cryptography; Divisor class group; Elliptic curves; Function fields

Indexed keywords

COMPUTER CRIME; DATA PRIVACY; FUNCTION EVALUATION; SECURITY OF DATA;

DIVISOR CLASS GROUP; ELLIPTIC CURVE CRYPTOSYSTEM; ELLIPTIC CURVES; FUNCTION FIELDS;

CRYPTOGRAPHY;

EID: 0001788567     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-001-0011-x     Document Type: Article

References (18)

1. L. Adleman, J. De Marrais and M.-D. Huang. A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields. In ANTS-1: Algorithmic Number Theory, L.M. Adleman and M-D. Huang, editors. LNCS 877, pp. 28-40. Springer-Verlag, Berlin, 1994.
2. E. Artin and J. Tate. Class Field Theory. Benjamin, New York, 1967.
3. I.F. Blake, G. Seroussi and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, Cambridge, 1999.
4. D.G. Cantor. Computing in the Jacobian of a hyperelliptic curve. Math. Comp., 48, 95-101, 1987.
5. C. Chevalley. Introduction to the Theory of Algebraic Functions of One Variable. Mathematical Surveys Number VI. American Mathematical Society, Providence, RI, 1951.
6. A. Enge and P. Gaudry. A general framework for the discrete logarithm index calculus. To appear in Acta Arith.
7. 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.
8. G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Math. Comp., 62, 865-874, 1994.
9. S.D. Galbraith and N.P. Smart. A cryptographic application of Weil descent. In Cryptography and Coding, 1th IMA Conference. LNCS 1746, pp. 191-200. Springer-Verlag, Berlin, 1999. The full version of the paper is HP Labs Technical Report HPL-1999-70.
10. P. Gaudry. An algorithm for solving the discrete logarithm problem on hyperelliptic curves. In Advanced in Cryptology - EUROCRYPT 2000. LNCS 1807, pp. 19-34. Springer-Verlag, Berlin, 2000.
11. F. Heß. Zur Divisorenklassengruppenberechnung in globalen Funktionenkörpern. Dissertation, TU Berlin, 1999.
12. R. Lidl and H. Niederreiter. Finite Fields. Addison-Wesley, Reading, MA, 1983.
13. V. Müller, A. Stein and C. Thiel. Computing discrete logarithms in real quadratic function fields of large genus. Math. Comp., 68, 807-822, 1999.
14. J. Neukirch. Algebraic Number Theory. Springer-Verlag, New York, 1999.
15. R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44, 483-494, 1985.
16. J. H. Silverman. The Arithmetic of Elliptic Curves. GTM 106. Springer-Verlag, New York, 1986.
17. N.P. Smart. On the performance of hyperelliptic cryptosystems. In Advances in Cryptology, EUROCRYPT '99. LNCS 1592, pp. 165-175. Springer-Verlag, Berlin, 1999.
18. H. Stichtenoth. Algebraic Function Fields and Codes. Springer-Verlag, New York, 1993.