Public-Key Cryptosystems Based on the Discrete Logarithm Problem

  • Christof PaarEmail author
  • Jan Pelzl


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.


Cyclic Group Discrete Logarithm Primitive Element Discrete Logarithm Problem Elliptic Curve Cryptosystems 
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-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.Department of Electrical Engineering and Information SciencesRuhr-Universität BochumBochumGermany
  2. 2.Zentrum für IT-Sicherheitescrypt GmbH — Embedded SecurityBochumGermany

Personalised recommendations