Pollard's kangaroo algorithm

From Wikipedia, the free encyclopedia

In computational number theory and computational algebra, Pollard’s kangaroo algorithm (also Pollard’s lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known Pollard’s rho algorithm for solving the same problem.[1][2] 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.

Suppose $G$ is a finite cyclic group of order $n$ which is generated by the element $\alpha$ , and we seek to find the discrete logarithm $x$ of the element $\beta$ to the base $\alpha$ . In other words, one seeks $x\in Z_{n}$ such that $\alpha ^{x}=\beta$ . The lambda algorithm allows one to search for $x$ in some interval $[a,\ldots ,b]\subset Z_{n}$ . One may search the entire range of possible logarithms by setting $a=0$ and $b=n-1$ .

1. Choose a set $S$ of positive integers of mean roughly ${\sqrt {b-a}}$ and define a pseudorandom map $f:G\rightarrow S$ .

2. Choose an integer $N$ and compute a sequence of group elements ${x_{0},x_{1},\ldots ,x_{N}}$ according to:

$x_{0}=\alpha ^{b},$
$x_{i+1}=x_{i}\alpha ^{f(x_{i})}{\text{ for }}i=0,1,\ldots ,N-1$

3. Compute

$d=\sum {i=0}^{N-1}f(x{i}).$

Observe that:

$x_{N}=x_{0}\alpha ^{d}=\alpha ^{b+d},.$

4. Begin computing a second sequence of group elements ${y_{0},y_{1},\ldots }$ according to:

$y_{0}=\beta ,$
$y_{i+1}=y_{i}\alpha ^{f(y_{i})}{\text{ for }}i=0,1,\ldots ,N-1$

and a corresponding sequence of integers ${d_{0},d_{1},\ldots }$ according to:

$d_{n}=\sum {i=0}^{n-1}f(y{i})$ .

Observe that:

$y_{i}=y_{0}\alpha ^{d_{i}}=\beta \alpha ^{d_{i}}{\mbox{ for }}i=0,1,\ldots ,N-1$

5. Stop computing terms of ${y_{i}}$ and ${d_{i}}$ when either of the following conditions are met:

A) $y_{j}=x_{N}$ for some $j$ . If the sequences ${x_{i}}$ and ${y_{j}}$ "collide" in this manner, then we have:

$x_{N}=y_{j}\Rightarrow \alpha ^{b+d}=\beta \alpha ^{d_{j}}\Rightarrow \beta =\alpha ^{b+d-d_{j}}\Rightarrow x\equiv b+d-d_{j}{\pmod {n}}$

and so we are done.

B) $d_{i}>b-a+d$ . If this occurs, then the algorithm has failed to find $x$ . Subsequent attempts can be made by changing the choice of $S$ and/or $f$ .

Pollard gives the time complexity of the algorithm as $O({\sqrt {b-a}})$ , using a probabilistic argument based on the assumption that $f$ acts pseudorandomly. Since $a,b$ can be represented using $O(\log b)$ bits, this is exponential in the problem size (though still a significant improvement over the trivial brute-force algorithm that takes time $O(b-a)$ ). For an example of a subexponential time discrete logarithm algorithm, see the index calculus algorithm.

The algorithm is well known by two names.

The first 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[3] 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[4] 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".

The second is "Pollard’s lambda algorithm". Much like the name of another of Pollard’s discrete logarithm algorithms, Pollard’s rho algorithm, this name refers to the similarity between a visualisation of the algorithm and the Greek letter lambda ( $\lambda$ ). The shorter stroke of the letter lambda corresponds to the sequence ${x_{i}}$ , since it starts from the position b to the right of x. Accordingly, the longer stroke corresponds to the sequence ${y_{i}}$ , 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 "kangaroo algorithm",[5] as this avoids confusion with some parallel versions of his rho algorithm, which have also been called "lambda algorithms".

^ Pollard, John M. (July 1978) [1977-05-01, 1977-11-18]. "Monte Carlo Methods for Index Computation (mod p)" (PDF). Mathematics of Computation. 32 (143). Mathematics Department, Plessey Telecommunications Research, Taplow Court, Maidenhead, Berkshire, UK: American Mathematical Society: 918–924. ISSN 0025-5718. Archived (PDF) from the original on 2013-05-03. Retrieved 2023-08-19. (7 pages)
^ van Oorschot, Paul C.; Wiener, Michael J. (1999). "Parallel collision search with cryptanalytic applications". Journal of Cryptology. 12 (1). International Association for Cryptologic Research: 1–28. doi:10.1007/PL00003816. ISSN 0933-2790.
^ Pollard, John M. (2000-08-10) [1998-01-23, 1999-09-27]. "Kangaroos, Monopoly and Discrete Logarithms" (PDF). Journal of Cryptology. 13 (4). Tidmarsh Cottage, Manor Farm Lane, Tidmarsh, Reading, UK: International Association for Cryptologic Research: 437–447. doi:10.1007/s001450010010. ISSN 0933-2790. Archived (PDF) from the original on 2023-08-18. Retrieved 2023-08-19. (11 pages)
^ Dawson, Terence J. (1977-08-01). "Kangaroos". Scientific American. Vol. 237, no. 2. Scientific American, Inc. pp. 78–89. ISSN 0036-8733. JSTOR 24954004.
^ Pollard, John M. "Jmptidcott2". Archived from the original on 2023-08-18. Retrieved 2023-08-19.
^ Pollard, John M. (July 2000). "Kruskal’s Card Trick" (PDF). The Mathematical Gazette. 84 (500). Tidmarsh Cottage, Manor Farm Lane, Tidmarsh, Reading, UK: The Mathematical Association: 265–267. doi:10.2307/3621657. ISSN 0025-5572. JSTOR 3621657. 84.29. Archived (PDF) from the original on 2023-08-18. Retrieved 2023-08-19. (1+3 pages)

Montenegro, Ravi [at Wikidata]; Tetali, Prasad V. (2010-11-07) [2009-05-31]. How Long Does it Take to Catch a Wild Kangaroo? (PDF). Proceedings of the forty-first annual ACM symposium on Theory of computing (STOC 2009). pp. 553–560. arXiv:0812.0789. doi:10.1145/1536414.1536490. S2CID 12797847. Archived (PDF) from the original on 2023-08-20. Retrieved 2023-08-20.

Similar Posts