Pohlig–Hellman algorithm: Difference between revisions

Revision as of 04:13, 29 January 2006

Revision as of 11:38, 31 January 2006

Line 1:

Possibile copyright violation: [http://encyclopedia.thefreedictionary.com/Pohlig-Hellman+algorithm copied from this page]

In mathematics, the '''Pohlig-Hellman algorithm''' is an [[algorithm]] for the computation of [[discrete logarithm]]s in a [[multiplicative group]] whose order is a [[smooth integer]]. The algorithm is based on the [[Chinese remainder theorem]] and runs in [[polynomial time]].