Factoring with two large primes

We describe a modification to the well-known large prime variant of the multiple polynomial quadratic sieve factoring algorithm. In practice this leads to a speed-up factor of 2 to 2.5. We discuss several implementation-related aspects, and we include some examples. Our new variation is also of practical importance for the number field sieve factoring algorithm.


Published in:
Mathematics of computation, 63, 208, 785-798
Year:
1991
Keywords:
Laboratories:




 Record created 2010-06-25, last modified 2018-03-17

N/A:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)