## Notes

The Pohlig-Hellman algorithm computes the discrete logarithm in a multiplicative group with order that is a smooth integer, or an integer that factors completely into small prime numbers. The Poholig-Hellman algorithm computes the discrete log x such that $e \equiv g^x \mod p$ if such an x exists.