Dixon, B.Lenstra, Arjen K.2010-06-242010-06-242010-06-24199410.1007/3-540-48285-7_3https://infoscience.epfl.ch/handle/20.500.14299/51007We 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 monthcryptographyparallel algorithmsparallel machinespolynomialstext::conference output::conference proceedings::conference paper