Pollard's kangaroo algorithm: Difference between revisions

Revision as of 18:49, 23 January 2009

Revision as of 15:55, 21 April 2009

Line 40:

The second is "Pollard's kangaroo algorithm". This name is a reference to an analogy used in the paper presenting the algorithm, where the algorithm is explained in terms of using a ''tame'' [[kangaroo]] to trap a ''wild'' kangaroo. Pollard has explained<ref>J. M. Pollard, ''Kangaroos, Monopoly and Discrete Logarithms'', Journal of Cryptology, Volume 13, pp 437-447, 2000</ref> that this analogy was inspired by a "fascinating " article published in the same issue of ''[[Scientific American]]'' as an exposition of the [[RSA]] [[public key cryptosystem]]. The article<ref>T. J. Dawson, ''Kangaroos'', Scientific American, August 1977, pp. 78-89</ref> described an experiment in which a kangaroo's "energetic cost of locomotion, measured in terms of oxygen consumption at various speeds, was determined by placing kangaroos on a [[treadmill]]".

Pollard has expressed a preference for the name "kangaroo algorithm"{{Fact|date=August 2007}}<ref>http://jmptidcott.googlepages.com/nthy.html</ref>, as this avoids confusion with some parallel versions of his rho algorithm, which have also been called "lambda algorithms".

==See also==