In mathematics, the Pohlig-Hellman algorithm is an algorithm for the computation of discrete logarithms in a multiplicative group whose order is a smooth integer. The algorithm is based on the Chinese remainder theorem and runs in polynomial time.
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |