Received: 2012-12-14
Revised: 2013-08-02
Accepted: 2013-12-23
Published Online: 2014-01-16
Published in Print: 2014-02-01
ยฉ 2014 by Walter de Gruyter Berlin/Boston
Articles in the same Issue
- Frontmatter
- Constructing elliptic curve isogenies in quantum subexponential time
- Persistent asymmetric password-based key exchange
- Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
- Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7 (2013), 31โ42]
Keywords for this article
Pollard rho;
additive walk;
collision bound;
random walk;
mixing times
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- Frontmatter
- Constructing elliptic curve isogenies in quantum subexponential time
- Persistent asymmetric password-based key exchange
- Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
- Erratum Self-pairings on hyperelliptic curves [J. Math. Cryptol. 7 (2013), 31โ42]