Revision as of 05:28, 29 May 2011 edit Ciphergoth (talk \| contribs) Extended confirmed users 4,514 edits Remove markup that assumes the group is the multiplicative one mod N; this applies also to eg elliptic curves ← Previous edit		Revision as of 20:58, 24 July 2011 edit undo Bender235 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers, Template editors 472,805 edits →References Next edit →
Line 108: ==References== {{cite journal \|first=J. M. \|last=Pollard, ''\|title=Monte Carlo methods for index computation (mod ''p'',) \|journal=[[Mathematics of Computation~~, Volume~~]] \|volume=32, \|year=1978. \|issue=143 \|pages=918–924 \|doi= \|jstor=2006496 }} {{cite book \|first=Alfred J. \|last=Menezes, \|first2=Paul C. \|last2=van Oorschot~~, and~~ \|first3=Scott A. \|last3=Vanstone, [\|chapterurl=http://www.cacr.math.uwaterloo.ca/hac/about/chap3.pdf \|title=Handbook of Applied Cryptography, \|chapter=Chapter 3], \|year=2001. \|___location= \|publisher= \|isbn= }} {{Number-theoretic algorithms}}

Pollard's rho algorithm for logarithms: Difference between revisions