Toward a theory of Pollard's rho method

DOI10.1016/0890-5401(91)90001-IzbMath0716.11065WikidataQ29031634 ScholiaQ29031634MaRDI QIDQ752762

Eric Bach

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

zbMATH Keywords

Pollard rho method of factorization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (7)

A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields ⋮ Weil bounds for singular curves ⋮ Dynamically distinguishing polynomials ⋮ Functional graphs of polynomials over finite fields ⋮ Periods of rational maps modulo primes ⋮ GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS ⋮ Periods of iterated rational functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random mappings with constraints on coalescence and number of origins
• Modifikationen des Pollard-Algorithmus
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• An improved Monte Carlo factorization algorithm
• Factorization of the Eighth Fermat Number
• A monte carlo method for factorization
• The Distribution of Absolutely Irreducible Polynomials in Several Indeterminates

This page was built for publication: Toward a theory of Pollard's rho method