본문 바로가기 메뉴바로가기

Papers

A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm

https://doi.org/10.1214/09-AAP625