Parallel Integer Factorization Using Quadratic Forms
Parallel Integer Factorization Using Quadratic Forms
S. McMath
2005 · DOI: 10.21236/ada436652
2 Citations
TLDR
The results suggest that the new implementation, which utilizes composition of quadratic forms, is slower for small numbers of processors, but is more efficient asymptotically as the number of processors grows.
