Revision as of 09:16, 9 August 2009 edit Charvest (talk \| contribs) 1,766 edits {{Number-theoretic algorithms}} ← Previous edit		Revision as of 09:04, 13 October 2009 edit undo 84.56.178.17 (talk) →References: Wrong link, the linked paper was "Discrete logarithms in ﬁnite ﬁelds and their cryptographic signiﬁcance" by Odlyzko Next edit →
Line 21: ==References== #S. Pohlig and M. Hellman. "[http://www-ee.~~dtc.umn~~stanford.edu/~~~odlyzko~~hellman/~~doc~~publications/~~arch/discrete.logs~~28.pdf An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance]", ''IEEE Transactions on Information Theory'' '''24''' (1978), pp. 106–110. {{Number-theoretic algorithms}}

Pohlig–Hellman algorithm: Difference between revisions