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 80,000 standard Pentium II PC's and 5,000 TWINKLE devices.

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Arjen K. Lenstra, Adi Shamir
• Keywords: Cryptology, EUROCRYPT 2000, Number Field Sieve, Quadratic Sieve, TWINKLE Factoring Device