conference paper
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
Type
conference paper
Author(s)
Dixon, B.
Date Issued
1994
Published in
Advances in Cryptology — EUROCRYPT ’93
Series title/Series vol.
Lecture Notes in Computer Science; 765
Start page
28
End page
39
Editorial or Peer reviewed
REVIEWED
Written at
OTHER
EPFL units
| Event name | Event place | Event date |
Lofthus, Norway | May 23–27, 1993 | |
Available on Infoscience
June 24, 2010
Use this identifier to reference this record