Skip to content

Glossary: Cryptography and PKI

Discrete logarithm problem

Also written: discrete logarithm

The hard problem of recovering the secret exponent from a value like g^a mod p. Its difficulty with large numbers is what keeps Diffie-Hellman safe.

Where the book teaches it

Related terms

Diffie-Hellman