Pollard's kangaroo algorithm

Pollard's kangaroo algorithm is a method in computational number theory and computational algebra for solving the discrete logarithm problem. It was introduced in 1978 by the number theorist John M. Pollard, in the same paper that introduced his better known Pollard's rho algorithm for the same problem. Although Pollard described it for the discrete logarithm problem in the multiplicative group of units modulo a prime, the algorithm is in fact generic and works in any finite cyclic group. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/