How long does it take to catch a wild kangaroo?

DOI10.1145/1536414.1536490zbMath1304.94103arXiv0812.0789OpenAlexW2098311453MaRDI QIDQ5172750

Ravi Montenegro, Prasad Tetali

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.0789

zbMATH Keywords

Markov chainmixing timedigital signaturediscrete logarithmPollard's kangaroo method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Randomized algorithms (68W20) Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

$$\mathsf {HIKE}$$ : Walking the Privacy Trail ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Computing low-weight discrete logarithms ⋮ Computing discrete logarithms in an interval ⋮ Removing Erasures with Explainable Hash Proof Systems

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