Collision of random walks and a refined analysis of attacks on the discrete logarithm problem

DOI10.1007/978-3-662-46447-2_6MaRDI QIDQ2941189zbMATH OpenOpenAlexFDO

Authors Shuji Kijima, Ravi Montenegro

Publication date 27 August 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46447-2_6

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
• On random walks for Pollard's rho method
• Kangaroos, monopoly and discrete logarithms

Cited in

(10)

• Algorithmic Number Theory
• Non-Degeneracy of Pollard Rho Collisions
• Recent progress on the elliptic curve discrete logarithm problem
• An efficient collision detection method for computing discrete logarithms with Pollard's rho
• Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
• On random walks for Pollard's rho method
• scientific article; zbMATH DE number 2086902 (Why is no real title available?)
• scientific article; zbMATH DE number 2085207 (Why is no real title available?)
• Kangaroos, monopoly and discrete logarithms
• Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms

This page was built for publication: Collision of random walks and a refined analysis of attacks on the discrete logarithm problem

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