Pohlig–Hellman algorithm: Difference between revisions

Revision as of 15:20, 27 January 2024

Revision as of 21:47, 27 January 2024

Line 1:

{{Short description|Algorithm for computing logarithms}}

[[File:Pohlig-Hellman-Diagram.svg|thumb|350px|alt=Pohlig Hellman Algorithm|Steps of the Pohlig–Hellman algorithm.]]

In [[group theory]], the '''Pohlig–Hellman algorithm''', sometimes credited as the '''Silver–Pohlig–Hellman algorithm''',<ref name="Mollin06p344">[[#Mollin06|Mollin 2006]], pg. 344</hrefref> 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 needed|date=October 2020}}