Revision as of 03:14, 11 November 2011 edit BD2412 (talk \| contribs) Autopatrolled, Administrators 2,527,268 edits →Naming: tagging or repairing Disambiguation pages with links, or other minor fixes, replaced: RSA → RSA using AWB ← Previous edit		Revision as of 21:55, 15 April 2012 edit undo 86.178.139.22 (talk) Removed description of Pollard, that was subjective and not relevant to the subject matter of the article. Next edit →
Line 1: In [[computational number theory]] and [[computational algebra]], '''Pollard's kangaroo algorithm''' (aka '''Pollard's lambda algorithm''', see [[#Naming\|Naming]] below) is an [[algorithm]] for solving the [[discrete logarithm]] problem. The algorithm was introduced in 1978 by the ~~accomplished~~ number theorist [[John Pollard (mathematician)\|J. M. Pollard]], in the same paper <ref>J. Pollard, ''Monte Carlo methods for index computation mod p'', Mathematics of Computation, Volume 32, 1978</ref> as his better-known [[Pollard's rho algorithm for logarithms\|rho algorithm]] for solving the same problem. Although Pollard described the application of his algorithm to the discrete logarithm problem in the multiplicative group of units modulo a prime ''p'', it is in fact a generic discrete logarithm algorithm—it will work in any finite cyclic group. ==The algorithm==

Pollard's kangaroo algorithm: Difference between revisions