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