Constructive and destructive facets of Weil descent on elliptic curves
 P. Gaudry,
 F. Hess,
 N. P. Smart
 … show all 3 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Abstract
In this paper we look in detail at the curves which arise in the method of Galbraith and Smart for producing curves in the Weil restriction of an elliptic curve over a finite field of characteristic 2 of composite degree. We explain how this method can be used to construct hyperelliptic cryptosystems which could be as secure as cryptosystems based on the original elliptic curve. On the other hand, we show that the same technique may provide a way of attacking the original elliptic curve cryptosystem using recent advances in the study of the discrete logarithm problem on hyperelliptic curves.
We examine the resulting higher genus curves in some detail and propose an additional check on elliptic curve systems defined over fields of characteristic 2 so as to make them immune from the methods in this paper.
 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 ANTS1: Algorithmic Number Theory, L.M. Adleman and MD. Huang, editors. LNCS 877, pp. 28–40. SpringerVerlag, Berlin, 1994.
 E. Artin and J. Tate. Class Field Theory. Benjamin, New York, 1967.
 I.F. Blake, G. Seroussi and N.P. Smart. Elliptic Curves in Cryptography. Cambridge University Press, Cambridge, 1999.
 D.G. Cantor. Computing in the Jacobian of a hyperelliptic curve. Math. Comp., 48, 95–101, 1987. CrossRef
 C. Chevalley. Introduction to the Theory of Algebraic Functions of One Variable. Mathematical Surveys Number VI. American Mathematical Society, Providence, RI, 1951.
 A. Enge and P. Gaudry. A general framework for the discrete logarithm index calculus. To appear in Acta Arith.
 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.
 G. Frey and H.G. Rück. A remark concerning mdivisibility and the discrete logarithm problem in the divisor class group of curves. Math. Comp., 62, 865–874, 1994. CrossRef
 S.D. Galbraith and N.P. Smart. A cryptographic application of Weil descent. In Cryptography and Coding, 7th IMA Conference. LNCS 1746, pp. 191–200. SpringerVerlag, Berlin, 1999. The full version of the paper is HP Labs Technical Report HPL199970. CrossRef
 P. Gaudry. An algorithm for solving the discrete logarithm problem on hyperelliptic curves. In Advanced in Cryptology — EUROCRYPT 2000. LNCS 1807, pp. 19–34. SpringerVerlag, Berlin, 2000.
 F. Heß. Zur Divisorenklassengruppenberechnung in globalen Funktionenkörpern. Dissertation, TU Berlin, 1999.
 R. Lidl and H. Niederreiter. Finite Fields. AddisonWesley, Reading, MA, 1983.
 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. CrossRef
 J. Neukirch. Algebraic Number Theory. SpringerVerlag, New York, 1999.
 R. Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp., 44, 483–494, 1985. CrossRef
 J. H. Silverman. The Arithmetic of Elliptic Curves. GTM 106. SpringerVerlag, New York, 1986.
 N.P. Smart. On the performance of hyperelliptic cryptosystems. In Advances in Cryptology, EUROCRYPT ’99. LNCS 1592, pp. 165–175. SpringerVerlag, Berlin, 1999.
 H. Stichtenoth. Algebraic Function Fields and Codes. SpringerVerlag, New York, 1993.
 Title
 Constructive and destructive facets of Weil descent on elliptic curves
 Journal

Journal of Cryptology
Volume 15, Issue 1 , pp 1946
 Cover Date
 20020301
 DOI
 10.1007/s001450010011x
 Print ISSN
 09332790
 Online ISSN
 14321378
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Function fields
 Divisor class group
 Cryptography
 Elliptic curves
 Industry Sectors
 Authors

 P. Gaudry ^{(1)}
 F. Hess ^{(2)}
 N. P. Smart ^{(3)}
 Author Affiliations

 1. LIX, École Polytechnique, 91128, Palaiseau, France
 2. School of Mathematics and Statistics F07, University of Sydney, 2006, Sydney, NSW, Australia
 3. Computer Science Department, University of Bristol, Woodland Road, BS8 1UB, Bristol, England