Factoring Integers Using SIMD Sieves (original) (raw)

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.

Chapter PDF

Similar content being viewed by others

References

  1. Bernstein, D. J., Lenstra, A. K.: A general number field sieve implementation (to appear)
    Google Scholar
  2. Caron, T. R., Silverman, R. D.: Parallel implementation of the quadratic sieve. J. Supercomputing 1 (1988) 273–290
    Article Google Scholar
  3. Davis, J. A., Holdridge, D. B.: Factorization using the quadratic sieve algorithm. Tech. Report SAND 83-1346, Sandia National Laboratories, Albuquerque, NM, 1983
    Google Scholar
  4. Dixon, B., Lenstra, A.K.: Massively parallel elliptic curve factoring. Advances in Cryptology, Eurocrypt’92, Lecture Notes in Comput. Sci. 658 (1993) 183–193
    Google Scholar
  5. Gjerken, A.: Faktorisering og parallel prosessering (in norwegian), Bergen, 1992
    Google Scholar
  6. Lenstra, A. K.: Massively parallel computing and factoring. Proceedings Latin’92, Lecture Notes in Comput. Sci. 583 (1992) 344–355
    Google Scholar
  7. Lenstra, A. K., Lenstra, H.W., Jr.: Algorithms in number theory. Chapter 12 in: van Leeuwen, J. (ed.): Handbook of theoretical computer science. Volume A, Algorithms and complexity. Elsevier, Amsterdam, 1990
    Google Scholar
  8. Lenstra, A. K., Lenstra, H. W., Jr., Manasse, M. S., Pollard, J. M.: The factorization of the ninth Fermat number. Math. Comp. 61 (1993) (to appear)
    Google Scholar
  9. Lenstra, A.K., Manasse, M.S.: Factoring by electronic mail. Advances in Cryptology, Eurocrypt’ 89, Lecture Notes in Comput. Sci. 434 (1990) 355–371
    Google Scholar
  10. Lenstra, A. K., Manasse, M.S.: Factoring with two large primes. Math. Comp. (to appear)
    Google Scholar
  11. MasPar MP-1 principles of operation. MasPar Computer Corporation, Sunnyvale, CA, 1989
    Google Scholar
  12. Pomerance, C: Analysis and comparison of some integer factoring algorithms. 89–139 in: Lenstra, H. W., Jr., Tijdeman, R. (eds): Computational methods in number theory. Math. Centre Tracts 154/155, Mathematisch Centrum, Amsterdam, 1983
    Google Scholar
  13. Pomerance, C, Smith, J. W., Tuler, R.: A pipeline architecture for factoring large integers with the quadratic sieve algorithm. SIAM J. Comput. 17 (1988) 387–403
    Article MATH MathSciNet Google Scholar
  14. te Riele, H., Lioen, W., Winter, D.: Factorization beyond the googol with mpqs on a single computer. CWI Quarterly 4 (1991) 69–72
    MATH MathSciNet Google Scholar
  15. RSA Data Security Corporation Inc., sci.crypt, May 18, 1991; information available by sending electronic mail to challenge-rsa-list@rsa.com
    Google Scholar
  16. Silverman, R. D.: The multiple polynomial quadratic sieve. Math. Comp. 84 (1987) 327–339
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Princeton University, Princeton, NJ, 08544, USA
    Brandon Dixon
  2. Room MRE-2Q334, Bellcore, 445 South Street, Morristown, NJ, 07960, USA
    Arjen K. Lenstra

Authors

  1. Brandon Dixon
  2. Arjen K. Lenstra

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, Høyteknologisenteret, N-5020, Bergen, Norway
    Tor Helleseth

Rights and permissions

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/3-540-48285-7\_3

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us