On random walks for Pollard's rho method

  title={On random walks for Pollard's rho method},
  author={Edlyn Teske},
  journal={Math. Comput.},
We consider Pollard’s rho method for discrete logarithm computation. Usually, in the analysis of its running time the assumption is made that a random walk in the underlying group is simulated. We show that this assumption does not hold for the walk originally suggested by Pollard: its performance is worse than in the random case. We study alternative walks that can be efficiently applied to compute discrete logarithms. We introduce a class of walks that lead to the same performance as expected… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 112 citations. REVIEW CITATIONS

9 Figures & Tables



Citations per Year

113 Citations

Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.