Loading...
research article
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.
Loading...
Name
EPFL-CONF-149704.pdf
Access type
openaccess
Size
1.59 MB
Format
Adobe PDF
Checksum (MD5)
ab9a119fe83b92a2e1b104567c3c130f