How long does it take to catch a wild kangaroo?

From MaRDI portal



Abstract: We develop probabilistic tools for upper and lower bounding the expected time until two independent random walks on intersect each other. This leads to the first sharp analysis of a non-trivial Birthday attack, proving that Pollard's Kangaroo method solves the discrete logarithm problem gx=h on a cyclic group in expected time (2+o(1))sqrtb−a for an average xinuar[a,b]. Our methods also resolve a conjecture of Pollard's, by showing that the same bound holds when step sizes are generalized from powers of 2 to powers of any fixed n.











This page was built for publication: How long does it take to catch a wild kangaroo?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5172750)