Richard P. Brent 2026-11-05
Richard P. Brent works on computational mathematics, including arithmetic algorithms, integer factorization and numerical methods. His ANU publication and software pages document these interests.[ref]
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]
An improved Monte Carlo factorization algorithm by Richard P. Brent. Sections 2–7, cycle finding and factorization