论文信息 - Factoring Integers Using SIMD Sieves

Factoring Integers Using SIMD Sieves

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.

Arjen K. Lenstra | Brandon Dixon | A. K. Lenstra | Brandon Dixon

[1] Arjen K. Lenstra,et al. Massively parallel elliptic curve factoring , 1993, CRYPTO 1993.

[2] Hendrik W. Lenstra,et al. Computational methods in number theory , 1982 .

[3] Robert D. Silverman. The multiple polynomial quadratic sieve , 1987 .

[4] Arjen K. Lenstra. Massively Parallel Computing and Factoring , 1992, LATIN.

[5] W. M. Lioen,et al. Factorization beyond the Googol with MPQS on a single computer , 1991 .

[6] A. K. Lenstra,et al. The factorization of the ninth Fermat number , 1993 .

[7] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[8] Jeffrey W. Smith,et al. A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm , 1988, SIAM J. Comput..

[9] James A. Davis,et al. Factorization Using the Quadratic Sieve Algorithm , 1983, CRYPTO.

[10] Dj Daniel Bernstein,et al. A general number field sieve implementation , 1993 .

[11] Arjen K. Lenstra,et al. Factoring by Electronic Mail , 1990, EUROCRYPT.

[12] Arjen K. Lenstra,et al. Factoring With Two Large Primes , 1990, EUROCRYPT.

[13] Arjen K. Lenstra,et al. Algorithms in Number Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.