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
Bernstein, D. J., Lenstra, A. K.: A general number field sieve implementation (to appear)
Caron, T. R., Silverman, R. D.: Parallel implementation of the quadratic sieve. J. Supercomputing 1 (1988) 273–290
Davis, J. A., Holdridge, D. B.: Factorization using the quadratic sieve algorithm. Tech. Report SAND 83-1346, Sandia National Laboratories, Albuquerque, NM, 1983
Dixon, B., Lenstra, A.K.: Massively parallel elliptic curve factoring. Advances in Cryptology, Eurocrypt’92, Lecture Notes in Comput. Sci. 658 (1993) 183–193
Gjerken, A.: Faktorisering og parallel prosessering (in norwegian), Bergen, 1992
Lenstra, A. K.: Massively parallel computing and factoring. Proceedings Latin’92, Lecture Notes in Comput. Sci. 583 (1992) 344–355
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
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)
Lenstra, A.K., Manasse, M.S.: Factoring by electronic mail. Advances in Cryptology, Eurocrypt’ 89, Lecture Notes in Comput. Sci. 434 (1990) 355–371
Lenstra, A. K., Manasse, M.S.: Factoring with two large primes. Math. Comp. (to appear)
MasPar MP-1 principles of operation. MasPar Computer Corporation, Sunnyvale, CA, 1989
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
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
te Riele, H., Lioen, W., Winter, D.: Factorization beyond the googol with mpqs on a single computer. CWI Quarterly 4 (1991) 69–72
RSA Data Security Corporation Inc., sci.crypt, May 18, 1991; information available by sending electronic mail to challenge-rsa-list@rsa.com
Silverman, R. D.: The multiple polynomial quadratic sieve. Math. Comp. 84 (1987) 327–339
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 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
DOI: https://doi.org/10.1007/3-540-48285-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57600-6
Online ISBN: 978-3-540-48285-7
eBook Packages: Springer Book Archive
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.