Revision as of 19:17, 29 August 2010 edit Vermiceli (talk \| contribs) Extended confirmed users 1,566 edits fixed ref and added when can use baby-step giant step ← Previous edit		Revision as of 19:17, 29 August 2010 edit undo Vermiceli (talk \| contribs) Extended confirmed users 1,566 edits m fix year Next edit →
Line 1: In [[number theory]], the '''Pohlig–Hellman algorithm''' sometimes credited as the '''Silver-Pohlig-Hellman algorithm'''<ref name="Mollin06p344">[[#Mollin06\|Mollin ~~1997~~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).

Pohlig–Hellman algorithm: Difference between revisions