A monte carlo method for factorization

1975/09/01 by J. M. Pollard · 15 citations
Computer Science · #Digital Filter Design and Implementation #Matrix Theory and Algorithms #Numerical Methods and Algorithms

paper · doi:10.1007/bf01933667

crossref issued 1975/09/01 · crossref published 1975/09/01 · crossref published-print 1975/09/01 · openalex publication_date 1975/09/01 · crossref created 2005/07/25 · crossref deposited 2019/05/10 · openalex created_date 2025/10/10 · crossref indexed 2026/07/30 · openalex updated_date 2026/07/31

Cited by

• PFCS: Prime Factorization Cache System for Deterministic Data Relationship Discovery
• Permutation polynomials: iteration of shift and inversion maps over\n finite fields
• Integer Factorization By Sieving The Delta
• Choosing iteration maps for the parallel Pollard rho method
• On the Number of Periodic Points of Quadratic Dynamical Systems Modulo a Prime
• Robust Probabilistic Bisimilarity for Labelled Markov Chains
• Index Divisibility in Dynamical Sequences and Cyclic Orbits Modulo p
• Imperfect Forward Secrecy
• Speeding the Pollard and elliptic curve methods of factorization
• Integer Factoring
• Refined analysis and improvements on some factoring algorithms
• Euler’s constant: Euler’s work and modern developments
• Integer Factoring
• Modular multiplication without trial division
• Cycle detection [wikipedia]