Abstract
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).
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Buchmann, J.A. (2004). Discrete Logarithms. In: Introduction to Cryptography. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9003-7_10
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9003-7_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-20756-8
Online ISBN: 978-1-4419-9003-7
eBook Packages: Springer Book Archive