Technical dictionary
Discrete logarithm problem
Hard problem underlying DH and many ECC schemes—efficiently solvable by Shor’s algorithm on a CRQC.
Definition
The discrete log problem asks for the exponent given a generator and group element. Classical hardness underpins Diffie–Hellman and elliptic-curve crypto.
Shor’s algorithm solves discrete logs in quantum polynomial time for relevant groups—hence ECDH/ECDSA are not post-quantum.