Pohlig–Hellman algorithm

This is an old revision of this page, as edited by Mathbot (talk | contribs) at 22:40, 4 July 2005 (Robot-assisted link insertion.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This is an algorithm based on Chinese remainder problem which can compute the discrete logarithm in a multiplicative group of order q in polynomial time if q is a smooth integer.