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).
KeywordsCyclic Group Group Element Prime Divisor Multiplicative Group Discrete Logarithm
Unable to display preview. Download preview PDF.