A pipeline architecture for factoring large integers with the quadratic sieve algorithm
SIAM Journal on Computing - Special issue on cryptography
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Handbook of theoretical computer science (vol. A)
Factoring with two large primes
Mathematics of Computation
Massively Parallel Computing and Factoring
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Massively parallel elliptic curve factoring
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Parallel collision search with application to hash functions and discrete logarithms
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
Factoring large numbers with programmable hardware
FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
On the Factorization of RSA-120
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
Analysis of Bernstein's Factorization Circuit
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Elliptic Curve Arithmetic Using SIMD
ISC '01 Proceedings of the 4th International Conference on Information Security
Factorization of a 512-bit RSA modulus
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
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.