In group theory, the Pohlig–Hellman algorithm sometimes is a special-purpose algorithm for computing discrete logarithms in a multiplicative group whose order is a smooth integer.

In group theory, The Pohlig–Hellman algorithm sometimes is a special-purpose algorithm for computing discrete logarithms in a multiplicative group whose order is a smooth integer.