Analysis and optimization of the TWINKLE factoring device

A.K. Lenstra, A. Shamir

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

23 Citations (Scopus)
1 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT 2000 (Proceedings International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000)
EditorsB. Preneel
Place of PublicationBerlin
PublisherSpringer
Pages35-52
ISBN (Print)3-540-67517-5
DOIs
Publication statusPublished - 2000

Publication series

NameLecture Notes in Computer Science
Volume1807
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Analysis and optimization of the TWINKLE factoring device'. Together they form a unique fingerprint.

Cite this