Revision as of 11:08, 8 November 2011 edit 114.25.1.219 (talk) base-b to base-p_1 since base-b is incorrect ← Previous edit		Revision as of 04:19, 6 May 2012 edit undo Helpful Pixie Bot (talk \| contribs) Bots 571,497 edits m ISBNs (Build KC) Next edit →
Line 26: ==References== {{cite book\|title=An Introduction To Cryptography\|last=Mollin\|first= Richard\|date=2006-09-18\|publisher=Chapman and Hall/CRC\|edition=2nd\|isbn=978-~~1584886181~~1-58488-618-1\|page=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\|authorlink1=Alfred Menezes\|first2=Paul C.\|last2=van Oorschot\|authorlink2=Paul van Oorschot\|first3=Scott A.\|last3=Vanstone\|authorlink3=Scott Vanstone\|title=Handbook of Applied Cryptography\|url=http://www.cacr.math.uwaterloo.ca/hac/\|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\|ref=Menezes97}}

Pohlig–Hellman algorithm: Difference between revisions