Pohlig–Hellman algorithm: Difference between revisions

Revision as of 16:11, 28 May 2011

Revision as of 06:30, 21 August 2011

Line 1:

In [[number theory]], the '''Pohlig–Hellman algorithm''' sometimes credited as the '''Silver-Pohlig–HellmanSilver–Pohlig–Hellman algorithm'''<ref name="Mollin06p344">[[#Mollin06|Mollin 2006]], pg. 344</ref> is a [[special-purpose]] [[algorithm]] for computing [[discrete logarithm]]s in a [[multiplicative group]] whose order is a [[smooth integer]].

The algorithm was discovered by Roland Silver, but first published by [[Stephen Pohlig]] and [[Martin Hellman]] (independent of Silver).