Content deleted Content added
Tito Omburo (talk | contribs) →Groups of prime-power order: e need not be smaller than p |
the requested citation is the original one by Pohlig and Hellman, already listed in the references |
||
Line 3:
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]], who credit Silver with its earlier
== Groups of prime-power order ==
| |||