Richard P. Brent 2026-11-05
His 1980 factorization paper improves cycle detection in iterated sequences and applies it to a Monte Carlo factorization method. A collision modulo an unknown prime divisor can be exposed through a greatest common divisor, even when the iterates do not coincide modulo the whole integer. Batching computations and improving cycle finding reduce the work required.[ref]