Factorization of large integers on some vector and parallel computers
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.
|Collections||ANU Research Publications|
|1617-01.2003-07-08T23:57:37Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-95-01.pdf||174.46 kB||Adobe PDF|