Skip to main content
Conference ProceedingsOPEN ACCESS

Factoring integers using SIMD sieves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 765 LNCS 28-39
DOI: 10.1007/3-540-48285-7_3
15Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Dixon, B., & Lenstra, A. K. (1994). Factoring integers using SIMD sieves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 765 LNCS, pp. 28–39). Springer Verlag. https://doi.org/10.1007/3-540-48285-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free