Factoring integers using SIMD sieves (original) (raw)

Factoring integers using SIMD sieves

1994

Advances in Cryptology — EUROCRYPT ’93

We describe a single-instruction multiple data (SIMD) implementation of the multiple polynomial quadratic sieve integer factoring algorithm. On a 16K MasPar massively parallel computer, the 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

Name

EPFL-CONF-149472.pdf

Checksum

(MD5)

a2e29a8d72f92188fbef2dcbae81a0c8