Public-Key Cryptosystems Based on the Discrete Logarithm Problem
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.
KeywordsCyclic Group Discrete Logarithm Primitive Element Discrete Logarithm Problem Elliptic Curve Cryptosystems
Unable to display preview. Download preview PDF.