Abstract
This paper gives some details about howWeil descent can be used to solve the discrete logarithm problem on elliptic curves which are defined over finite fields of small characteristic. The original ideas were first introduced into cryptography by Frey. We discuss whether these ideas are a threat to existing public key systems based on elliptic curves.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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. Springer-Verlag, LNCS 877, 28–40, 1994.
L.M. Adleman, M.-D. Huang. Primality testing and abelian varieties over finite fields. Springer LNM 1512, 1992.
M. Daberkow, C. Fieker, J. Klüners, M. Pohst, K. Roegner, M. Schörnig, and K. Wildanger. KANT V4. J. Symbolic Computation, 24, 267–283, 1997.
G. Frey. Weil descent. Talk at Waterloo workshop on the ECDLP, 1998. http://cacr.math.uwaterloo.ca/conferences/1998/ecc98/slides.html
S.D. Galbraith, S. Paulus and N.P. Smart. Arithmetic on super-elliptic curves. Preprint, 1998.
S.D. Galbraith and N.P. Smart. A cryptographic application of Weil descent. HPLabs Technical Report, HPL-1999-70.
P. Gaudry. A variant of the Adleman-DeMarrais-Huang algorithm and its application to small genera. Preprint, 1999.
J.L. Hafner and K.S. McCurley. A rigorous subexponential algorithm for computation of class groups. J. AMS, 2, 837–850, 1989.
R. Hartshorne. Algebraic geometry. Springer GTM 52, 1977.
M.-D. Huang, D. Ierardi. Counting points on curves over finite fields. J. Symbolic Computation, 25, 1–21, 1998.
J.S. Milne. Jacobian Varieties. In Arithmetic Geometry, G. Cornell and J.H. Silverman, editors. Springer-Verlag, 167–212, 1986.
D. Mumford. Abelian varieties. Oxford, 1970.
J. Pila. Frobenius maps of abelian varieties and finding roots of unity in finite fields. Math. Comp., 55, 745–763, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galbraith⋆, S.D., Smart, N.P. (1999). A Cryptographic Application of Weil Descent. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_23
Download citation
DOI: https://doi.org/10.1007/3-540-46665-7_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66887-9
Online ISBN: 978-3-540-46665-9
eBook Packages: Springer Book Archive