Tag Info


In cryptography, a discrete logarithm is the number of times a generator of a group must be multiplied by itself to produce a known number. By choosing certain groups, the task of finding a discrete logarithm can be made intractable. Many cryptographic primitives and protocols have security reductions to the discrete logarithm or related problems.

While finding discrete logarithms is hard on a classical computer, quantum computers can find them efficiently.

history | show excerpt | excerpt history