Factoring Integers Using SIMD Sieves

  • Brandon Dixon
  • Arjen K. Lenstra
Conference paper

DOI: 10.1007/3-540-48285-7_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 765)
Cite this paper as:
Dixon B., Lenstra A.K. (1994) Factoring Integers Using SIMD Sieves. In: Helleseth T. (eds) Advances in Cryptology — EUROCRYPT ’93. EUROCRYPT 1993. Lecture Notes in Computer Science, vol 765. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Brandon Dixon
    • 1
  • Arjen K. Lenstra
    • 2
  1. 1.Department of Computer SciencePrinceton UniversityPrincetonUSA
  2. 2.Room MRE-2Q334BellcoreMorristownUSA

Personalised recommendations