How can I compute discrete logs faster? — Pohlig–Hellman — The Ross Program
Channel: Jim Fowler
Date: 2020-07-22

Suppose a ≡ bˣ mod m and we know a, b, m.  Can you find x, and find it quickly?  This is the "discrete log problem" and we meet the Pohlig–Hellman algorithm for solving this problem more quickly than merely applying brute force.