AWhat changed
Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model.
Scientific scope
Pollard introduced a low-storage iterative method for finding integer factors through collisions modulo an unknown factor, with a heuristic square-root operation estimate in the factor size under a random-mapping model. The method uses modular iteration and cycle/collision structure to seek a factor. Its expected behavior depends on heuristic randomness and the factor size; it is not a deterministic polynomial-time factorization guarantee. Failed runs may require changing parameters and do not prove primality. Later improvements and computational records retain separate credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- J. M. Pollard · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Pollard, AMonte Carlo Methodfor Factorization, BIT 15(3),331-334(1975), original 4 pagejournal
- Publisher Crossrefdepositfor 10.1007/BF 01933667
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction