An efficient collision detection method for computing discrete logarithms with Pollard's rho

DOI10.1155/2012/635909zbMath1235.65161OpenAlexW1968515799WikidataQ58906288 ScholiaQ58906288MaRDI QIDQ411043

Fangguo Zhang, Ping Wang

Publication date: 4 April 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/635909

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to group theory (20-04)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient signature generation by smart cards
• Parallel collision search with cryptanalytic applications
• Cycle detection using a stack
• On random walks for Pollard's rho method
• A Monte Carlo Factoring Algorithm With Linear Storage
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Elliptic Curve Cryptosystems
• New directions in cryptography
• A cryptanalytic time-memory trade-off
• An improved Monte Carlo factorization algorithm
• A monte carlo method for factorization
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• A space efficient algorithm for group structure computation
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Probability Distributions Related to Random Mappings

This page was built for publication: An efficient collision detection method for computing discrete logarithms with Pollard's rho