Work out discrete logarithm instantly with clear inputs, formula shown and shareable results.
The discrete logarithm asks for the exponent x with gˣ ≡ h (mod p). No efficient classical algorithm is known for large p, and that hardness is precisely what secures Diffie-Hellman key exchange.
Discrete logarithm
find x such that gˣ ≡ h (mod p)
x = 4, since 3⁴ = 81 = 4 × 17 + 13.
The best general algorithms take time roughly exponential in the digit count, so a 2048-bit modulus is out of reach — though Shor's quantum algorithm would break it.