Pohlig–Hellman algorithm: Difference between revisions

Revision as of 04:37, 31 October 2020

Revision as of 00:55, 19 December 2020

Line 46:

*{{cite book|title=An Introduction To Cryptography|url=https://archive.org/details/An_Introduction_to_Cryptography_Second_Edition|last=Mollin|first= Richard|date=2006-09-18|publisher=Chapman and Hall/CRC|edition=2nd|isbn=978-1-58488-618-1|page=[https://archive.org/details/An_Introduction_to_Cryptography_Second_Edition/page/n353 344]|ref=Mollin06}}

*{{cite journal | authors=S. Pohlig and [[Martin Hellman|M. Hellman]] | title=An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance | journal=[[IEEE]] Transactions on Information Theory | issue=24 | year=1978 | pages=106–110 | url=http://www-ee.stanford.edu/~hellman/publications/28.pdf}}

*{{cite book|first1=Alfred J.|last1=Menezes|authorlink1author-link1=Alfred Menezes|first2=Paul C.|last2=van Oorschot|authorlink2author-link2=Paul van Oorschot|first3=Scott A.|last3=Vanstone|authorlink3author-link3=Scott Vanstone|title=Handbook of Applied Cryptography|url=https://archive.org/details/handbookofapplie0000mene/page/107|publisher=[[CRC Press]]|year=1997|pages=[https://archive.org/details/handbookofapplie0000mene/page/107 107–109]|chapter=Number-Theoretic Reference Problems|chapterurlchapter-url=http://www.cacr.math.uwaterloo.ca/hac/about/chap3.pdf|isbn=0-8493-8523-7|ref=Menezes97|url-access=registration}}

{{Number-theoretic algorithms}}