Pohlig–Hellman algorithm: Difference between revisions

Revision as of 19:21, 8 July 2020

Revision as of 04:17, 31 October 2020

Line 2:

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

The algorithm was introduced by Roland Silver, but first published by [[Stephen Pohlig]] and [[Martin Hellman]] (independent of Silver).<!--{{Citation neededcn}} begin-->{{fix |link=Wikipedia:Citation needed |text=citation needed |class=Template-Fact }}<!--{{Citation needed}} end-->

== Groups of prime-power order ==