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
Richard P. Brent is a prominent mathematician known for his contributions to several areas of mathematics, including numerical analysis, computer algorithms, and computational number theory. He is particularly recognized for his work on integer factorization, which is a crucial topic in cryptography. Brent is also noted for developing efficient algorithms for arithmetic operations and has made significant contributions to the field of high-precision computation.
New to topics? Read the docs here!