Jump to content

Pohlig–Hellman algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 2a00:f41:89c:ca14:0:f:10e:ba01 (talk) at 15:20, 27 January 2024. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Pohlig Hellman Algorithm
Steps of the Pohlig–Hellman algorithm.

In group theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm,Cite error: A <ref> tag is missing the closing </ref> (see the help page).

Notes

References

  • Mollin, Richard (2006-09-18). An Introduction To Cryptography (2nd ed.). Chapman and Hall/CRC. p. 344. ISBN 978-1-58488-618-1.
  • S. Pohlig; M. Hellman (1978). "An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance" (PDF). IEEE Transactions on Information Theory (24): 106–110. doi:10.1109/TIT.1978.1055817.
  • Menezes, Alfred J.; van Oorschot, Paul C.; Vanstone, Scott A. (1997). "Number-Theoretic Reference Problems" (PDF). Handbook of Applied Cryptography. CRC Press. pp. 107–109. ISBN 0-8493-8523-7.