Paper: dvi (7K), pdf (104K), ps (42K).
In recent years the best known integer factorization algorithms have improved greatly, to the point where it is now easy to factor a 60-decimal digit number, and possible to factor numbers larger than 120 decimal digits, given the availability of enough computing power. However, the problem of integer factorization still appears difficult, both in a practical sense (for numbers of more than about 80 decimal digits), and in a theoretical sense (because none of the algorithms run in polynomial time).
We outline several recent integer factorization algorithms, including the elliptic curve algorithm (ECM), the multiple polynomial quadratic sieve (MPQS), and the special/general number field sieve (NFS), give examples of their use, and mention some applications.
Go to next publication
Return to Richard Brent's index page