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 7.5).KeywordsCyclic GroupGroup ElementPrime DivisorMultiplicative GroupDiscrete LogarithmThese 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
