The quadratic sieve factoring algorithm
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Lattice sieving and trial division
ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Factoring Large Numbers with the Twinkle Device (Extended Abstract)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Special-Purpose Hardware in Cryptanalysis: The Case of 1,024-Bit RSA
IEEE Security and Privacy
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Magnifying computing gaps: establishing encrypted communication over unidirectional channels
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
PET SNAKE: a special purpose architecture to implement an algebraic attack in hardware
Transactions on computational science X
An optical solution for the SAT Problem
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Scalable hardware for sparse systems of linear equations, with applications to integer factorization
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
A tutorial on high performance computing applied to cryptanalysis
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Solving binary linear equation systems over the rationals and binaries
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Hi-index | 0.00 |
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field Sieve factoring algorithms. The bottom line of our analysis is that the TWINKLE-assisted factorization of 768-bit numbers is difficult but doable in about 9 months (including the sieving and matrix parts) by a large organization which can use 80,000 standard Pentium II PC's and 5,000 TWINKLE devices.