The Past, Evolving Present, and Future of the Discrete Logarithm
- Antoine JouxAffiliated withCryptoExpertsChaire de Cryptologie de la Fondation de l’UPMCSorbonne Universités, LIP6, UMR 7606
- , Andrew OdlyzkoAffiliated withSchool of Mathematics, University of Minnesota
- , Cécile PierrotAffiliated withDGA/CNRS, Sorbonne Universités, LIP6, UMR 7606 Email author
The first practical public key cryptosystem ever published, the Diffie–Hellman key exchange algorithm, relies for its security on the assumption that discrete logarithms are hard to compute. This intractability hypothesis is also the foundation for the security of a large variety of other public key systems and protocols.
Since the introduction of the Diffie–Hellman key exchange more than three decades ago, there have been substantial algorithmic advances in the computation of discrete logarithms. However, in general the discrete logarithm problem is still considered to be hard. In particular, this is the case for the multiplicative groups of finite fields with medium to large characteristic and for the additive group of a general elliptic curve.
This chapter presents a survey of the state of the art concerning discrete logarithms and their computation.
- The Past, Evolving Present, and Future of the Discrete Logarithm
- Book Title
- Open Problems in Mathematics and Computational Science
- pp 5-36
- Print ISBN
- Online ISBN
- Springer International Publishing
- Copyright Holder
- Springer International Publishing Switzerland
- Additional Links
- Industry Sectors
- eBook Packages
- Çetin Kaya Koç (1)
- Editor Affiliations
- 1. Dept. of Computer Science, University of California, Santa Barbara
- Author Affiliations
- 2. CryptoExperts, Paris, France
- 3. Chaire de Cryptologie de la Fondation de l’UPMC, Paris, France
- 4. Sorbonne Universités, LIP6, UMR 7606, UPMC Univ Paris 06, Paris, France
- 5. School of Mathematics, University of Minnesota, Minneapolis, MN, 55455, USA
- 6. DGA/CNRS, Sorbonne Universités, LIP6, UMR 7606, UPMC Univ Paris 06, Paris, France
To view the rest of this content please follow the download PDF link above.