Skip navigation
Skip navigation

Factorization of large integers on some vector and parallel computers

Eldershaw, Craig; Brent, Richard P


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.

CollectionsANU Research Publications
Date published: 1995
Type: Working/Technical Paper


File Description SizeFormat Image
TR-CS-95-01.pdf174.46 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator