The discrete logarithm problem is the computational problem of finding an integer 
such that 
in a given finite group, when 
and 
are specified and such an 
exists. In a multiplicative
group modulo 
, this amounts to solving
 |
The apparent difficulty of this problem in suitable groups underlies the security of several public-key cryptosystems used in cryptography.
