activity
20042014
most citedA Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

30 citations · 59 across the 12 of their papers we have counts for

collaborators
Showing 2007 · math.PRShow all

1 paper · 2 filters

math.PR2007★ 30 cited

A Birthday Paradox for Markov chains with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

Jeong Han Kim, Ravi Montenegro, Yuval Peres +1

We show a Birthday Paradox for self-intersections of Markov chains with uniform stationary distribution. As an application, we analyze Pollard's Rho algorithm for finding the discr…