Analysis and optimization of the TWINKLE factoring device

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 80000 standard Pentium II PC's and 5000 TWINKLE devices


Published in:
Advances in Cryptology - EUROCRYPT 2000. International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings (Lecture Notes in Computer Science Vol.1807), 35 - 52
Presented at:
Advances in Cryptology - EUROCRYPT 2000. International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings (Lecture Notes in Computer Science Vol.1807), Berlin, Germany
Year:
2000
Keywords:
Laboratories:




 Record created 2010-06-25, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)