Chapter

Advances in Cryptology — EUROCRYPT ’93

Volume 765 of the series Lecture Notes in Computer Science pp 28-39

Date:

Factoring Integers Using SIMD Sieves

  • Brandon DixonAffiliated withDepartment of Computer Science, Princeton University
  • , Arjen K. LenstraAffiliated withRoom MRE-2Q334, Bellcore

Abstract

We describe our single-instruction multiple data (SIMD) implementation of the multiple polynomial quadratic sieve integer factoring algorithm. On a 16K MasPar massively parallel computer, our 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.