@inproceedings{77c1a193cbc24ca8a32708e7255ec844,
title = "Analysis and optimization of the TWINKLE factoring device",
abstract = "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 al- gorithms. The bottom line of our analysis is that the TWINKLE-assisted factorization of 768-bit numbers is di??cult 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.",
author = "A.K. Lenstra and A. Shamir",
year = "2000",
doi = "10.1007/3-540-45539-6_3",
language = "English",
isbn = "3-540-67517-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "35--52",
editor = "B. Preneel",
booktitle = "Advances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000)",
address = "Germany",
}