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 on a cyclic group in expected time for an average . 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 .
Recommendations
- Kangaroos, monopoly and discrete logarithms
- Solving discrete logarithm problem in an interval using periodic iterates
- Computing discrete logarithms with the parallelized kangaroo method.
- The parallelized Pollard kangaroo method in real quadratic function fields
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
Cited in
(6)
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)