The Discrete Logarithm Problem

  • Alfred Menezes
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 234)


There are many public-key cryptosystems whose security lies in the presumed intractability of the discrete logarithm problem in some group G. The discrete logarithm problem has received a great deal of attention in recent years, and numerous algorithms which use a variety of techniques have been devised. In Section 4.1 we briefly survey the algorithms known for this problem. In Section 4.2, we demonstrate efficient reductions of the logarithm problems in singular elliptic curves and some other groups to the logarithm problem in a finite field.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • Alfred Menezes
    • 1
  1. 1.Auburn UniversityAuburn

Personalised recommendations