# Discrete logarithm

The discrete logarithm problem is this: given a prime p, a generator g, and another non-zero residue class a mod p, find an integer n such that $g^n = a \hbox{ mod } p$. This problem is related to a number of cryptography systems, e.g. Diffie-Hellman.