Pohlig–Hellman algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Pohlig–Hellman algorithm" in English language version.

refsWebsite

Global rank English rank

179^th place

183^rd place

2^nd place

2^nd place

3,153^rd place

2,332^nd place

6^th place

6^th place

archive.org

Menezes, et al. 1997, pg. 108 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.

doi.org

Pohlig & Hellman 1978. Pohlig, S.; Hellman, M. (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.

stanford.edu

www-ee.stanford.edu

Pohlig & Hellman 1978. Pohlig, S.; Hellman, M. (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.

uwaterloo.ca

cacr.math.uwaterloo.ca

Menezes, et al. 1997, pg. 108 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.