Factorization of large integers on some vector and parallel computers

Abstract

We compare implementations of two integer factorization algorithms, the elliptic curve method (ECM) and a variant of the Pollard “rho" method, on three machines with parallel and/or vector architectures. ECM is scalable and well suited for both vector and parallel architectures. The “rho" method is simpler than ECM but is not scalable.