Pohlig–Hellman algorithm: Difference between revisions

Revision as of 19:07, 28 August 2010

Revision as of 16:19, 29 August 2010

Line 25:

{{Reflist}}

# {{cite journal | authors=S. Pohlig and [[Martin Hellman|M. Hellman]] | title=[http://www-ee.stanford.edu/~hellman/publications/28.pdf 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}}

# {{cite book | authorsfirst1=AAlfred J.|last1=Menezes|authorlink1=Alfred Menezes,|first2=Paul PC.|last2=van Oorschot|authorlink2=Paul van Oorschot,|first3=Scott SA. |last3=Vanstone |authorlink3=Scott Vanstone|title=[http://www.cacr.math.uwaterloo.ca/hac/ Handbook of Applied Cryptography] | publisher=[[CRC Press]] | year=1997 | pages=107–109 |chapter=Number-Theoretic Reference Problems|chapterurl=http://www.cacr.math.uwaterloo.ca/hac/about/chap3.pdf|isbn=0-8493-8523-7}}

{{Number-theoretic algorithms}}