Abstract
In the previous chapter we learned about the RSA public-key scheme. As we have seen, RSA is based on the hardness of factoring large integers. The integer factorization problem is said to be the one-way function of RSA.
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
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Paar, C., Pelzl, J. (2010). Public-Key Cryptosystems Based on the Discrete Logarithm Problem. In: Understanding Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04101-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-04101-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-44649-8
Online ISBN: 978-3-642-04101-3
eBook Packages: Computer ScienceComputer Science (R0)