Pollard's kangaroo algorithm: Difference between revisions

Revision as of 00:12, 26 August 2019

Revision as of 20:38, 26 August 2019

Line 39:

The second is "Pollard's lambda algorithm". Much like the name of another of Pollard's discrete logarithm algorithms, [[Pollard's rho algorithm for logarithms|Pollard's rho algorithm]], this name refers to the similarity between a visualisation of the algorithm and the [[Greek letter]] [[lambda]] (<math>\lambda</math>). The shorter stroke of the letter lambda corresponds to the sequence <math>\{x_i\}</math>, since it starts from the position b to the right of x. Accordingly, the longer stroke corresponds to the sequence <math>\{y_i\}</math>, which "collides with" the first sequence (just like the strokes of a lambda intersect) and then follows it subsequently.

Pollard has expressed a preference for the name Pollard rho kangaroo algorithm <ref>https://githubgitlab.com/Saadinrbitfranke/Pollardpollard-Rhorho-kangaroo</ref> as this avoids confusion with some parallel versions of his rho algorithm, which have also been called "lambda algorithms".

==See also==