Speeding Up the Pollard Rho Method on Prime Fields

DOI10.1007/978-3-540-89255-7_29zbMath1206.94061OpenAlexW1520933837MaRDI QIDQ3600392

Jin Hong, Jung Hee Cheon, Minkyu Kim

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_29

zbMATH Keywords

discrete logarithm problemprime field\(r\)-adding walkPollard rho

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Accelerating Pollard's rho algorithm on finite fields ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ Computing Interval Discrete Logarithm Problem with Restricted Jump Method

Uses Software

• NTL

Cites Work

• Parallel collision search with cryptanalytic applications
• Cycle detection using a stack
• Fast multiplication of large numbers
• 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
• New directions in cryptography
• An improved Monte Carlo factorization algorithm
• The Complexity of Finding Cycles in Periodic Functions
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Speeding Up the Pollard Rho Method on Prime Fields