Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Pohlig–Hellman algorithm
open-in-new
<p>In <a href="/facts/Group_theory/NfowcI5H">group theory</a>, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> for computing <a href="/facts/Discrete_logarithm/k8TXh5bL">discrete logarithms</a> in a <a href="/facts/Finite_abelian_group/FfWwmx4R">finite abelian group</a> whose order is a <a href="/facts/Smooth_integer/pC6DVLJW">smooth integer</a>. </p><p>The algorithm was introduced by Roland Silver, but first published by <a href="/facts/Stephen_Pohlig/J2JY8xFx">Stephen Pohlig</a> and <a href="/facts/Martin_Hellman/QCxKCFgn">Martin Hellman</a>, who credit Silver with its earlier independent but unpublished discovery. Pohlig and Hellman also list Richard Schroeppel and H. Block as having found the same algorithm, later than Silver, but again without publishing it. </p>