A Cryptographic Application of Weil Descent

  • Steven D. Galbraith⋆
  • Nigel P. Smart
Conference paper

DOI: 10.1007/3-540-46665-7_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1746)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Steven D. Galbraith⋆
    • 1
  • Nigel P. Smart
    • 2
  1. 1.Mathematics DepartmentRoyal Holloway University of LondonSurreyUK
  2. 2.Hewlett-Packard LaboratoriesBristolUK

Personalised recommendations