| |
| | Quadratic sieve - Wikipedia, the free encyclopedia |
 | | The quadratic sieve is a modification of Dixon's factorization method. |
 | | The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). |
 | | This approach (called MPQS, Multiple Polynomial Quadratic Sieve) is ideally suited for parallelization, since each processor involved in the factorization can be given n, the factor base and a collection of polynomials, and it will have no need to communicate with the central processor until it is finished with its polynomials. |
| en.wikipedia.org /wiki/Quadratic_sieve (2183 words) |
|