Choosing iteration maps for the parallel Pollard rho method

DOI10.1007/S10623-026-01865-3MaRDI QIDQ7288019zbMATH OpenFDO

Authors Finn Rudolph

Publication date 26 June 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-026-01865-3

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10)

Cites work

• A monte carlo method for factorization
• An improved Monte Carlo factorization algorithm
• Factorization of the Eighth Fermat Number
• scientific article; zbMATH DE number 47996 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• The \(n\)-th prime is greater than \(n \log n\).
• The cycle structure of unicritical polynomials
• Toward a theory of Pollard's rho method

This page was built for publication: Choosing iteration maps for the parallel Pollard rho method

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