arXiv · math/0611586
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log
Abstract
We analyze a fairly standard idealization of Pollard's Rho algorithm for finding the discrete logarithm in a cyclic group G. It is found that, with high probability, a collision occurs in $O(\sqrt{|G|\log |G| \log \log |G|})$ steps, not far from the widely conjectured value of $\Theta(\sqrt{|G|})$. This improves upon a recent result of Miller--Venkatesan which showed an upper bound of $O(\sqrt{|G|}\log^3 |G|)$. Our proof is based on analyzing an appropriate nonreversible, non-lazy random walk on a discrete cycle of (odd) length |G|, and showing that the mixing time of the corresponding walk is $O(\log |G| \log \log |G|)$.
Explore related subjects
Keep this discovery
Jeong Han Kim, Ravi Montenegro, Prasad Tetali. 2006-11-19. Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. https://doi.org/10.1109/focs.2007.38
Cite the original work for its findings. Save a collection to share your selection of sources.