Discrete Logarithms

  • Johannes A. Buchmann
Part of the Undergraduate Texts in Mathematics book series (UTM)


In this chapter, we discuss the difficulty of the discrete logarithm problem (DL problem). The security of many public-key cryptosystems is based on the difficulty of this problem. An example is the ElGamal cryptosystem (see Section 8.6).


Cyclic Group Group Element Prime Divisor Multiplicative Group Discrete Logarithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Johannes A. Buchmann
    • 1
  1. 1.Department of Computer ScienceTechnical UniversityDarmstadtGermany

Personalised recommendations