Factoring integers using SIMD sieves

We describe a single-instruction multiple data (SIMD) implementation of the multiple polynomial quadratic sieve integer factoring algorithm. On a 16K MasPar massively parallel computer, the implementation can factor 100 digit integers in a few days. Its most notable success was the factorization of the 110-digit RSA-challenge number, which took about a month