TWIRL
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (July 2012) |
 | This article relies largely or entirely on a single source. (July 2012) |
In cryptography and number theory, TWIRL (The Weizmann Institute Relation Locator) is a hypothetical hardware device designed to speed up the sieving step of the general number field sieve integer factorization algorithm.[1] During the sieving step, the algorithm searches for numbers with a certain mathematical relationship. In distributed factoring projects, this is the step that is parallelized to a large number of processors.
TWIRL is still a hypothetical device — no implementation has been publicly reported. However, its designers, Adi Shamir and Eran Tromer, estimate that if TWIRL were built, it would be able to factor 1024-bit numbers in one year at the cost of "a few dozen million US dollars". TWIRL could therefore have enormous repercussions in cryptography and computer security — many high-security systems still use 1024-bit RSA keys, which TWIRL would be able to break in a reasonable amount of time and for reasonable costs.
The security of some important cryptographic algorithms, notably RSA and the Blum Blum Shub pseudorandom number generator, rests in the difficulty of factorizing large integers. If factorizing large integers becomes easier, users of these algorithms will have to resort to using larger keys (computationally more expensive) or to using different algorithms, whose security rests on some other computationally hard problem (like the discrete logarithm problem).
See also
References
- ^ Shamir, Adi; Tromer, Eran (2003), "Factoring Large Numbers with the TWIRL Device", Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, pp. 1–26, doi:10.1007/978-3-540-45146-4_1, ISBN 9783540406747