Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields

DOI10.1007/978-3-031-22829-2_8zbMath1530.94037OpenAlexW4312576743MaRDI QIDQ6112011

Palash Sarkar, Madhurima Mukhopadhyay

Publication date: 4 August 2023

Published in: Security, Privacy, and Applied Cryptography Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-22829-2_8

zbMATH Keywords

discrete logarithm problemPollard's rhoMontgomery multiplicationtag tracing

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Accelerating Pollard's rho algorithm on finite fields
• Parallel collision search with cryptanalytic applications
• A Monte Carlo Factoring Algorithm With Linear Storage
• Modular Multiplication Without Trial Division
• Monte Carlo Methods for Index Computation (mod p)
• Montgomery Arithmetic from a Software Perspective

This page was built for publication: Combining Montgomery multiplication with tag tracing for the Pollard rho algorithm in prime order fields