ANU Computer Science Technical Reports


Craig Eldershaw and Richard P. Brent.
Factorization of large integers on some vector and parallel computers.
January 1995.
To appear in Proceedings of Neural, Parallel and Scientific Computations (edited by M. Sambandham), Vol. 1, 1995. (rpb156tr).

[POSTSCRIPT (78238 bytes)]

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.
Technical Reports <>
Last modified: Tue May 13 14:55:41 EST 1997