Number Theory and Cryptography: Parallel algorithms for integer factorisation
Number Theory and Cryptography: Parallel algorithms for integer factorisation
R. Brent
1990 · DOI: 10.1017/CBO9781107325838.004
24 Citations
TLDR
Several algorithms, including the elliptic curve method (ECM), and the multiple-polynomial quadratic sieve (MPQS) algorithm, are described, and it turns out that some of the algorithms are very well suited to parallel implementation.
