Factoring large numbers with the TWINKLE device (Extended abstract)

被引:0
|
作者
Shamir, A [1 ]
机构
[1] Weizmann Inst Sci, Dept Comp Sci, IL-76100 Rehovot, Israel
关键词
cryptanalysis; factoring; sieving; quadratic sieve; number field sieve; optical computing;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The current record in factoring large RSA keys is the factorization of a 465 bit (140 digit) number achieved in February 1999 by running the Number Field Sieve on hundreds of workstations for several months. This paper describes a novel factoring apparatus which call accelerate known sieve-based factoring algorithms by several orders of magnitude. It is based on a very simple handheld optoelectronic device which can analyse 100,000,000 large integers, and determine in less than 10 milliseconds which ones factor completely over a prime base consisting of the first 200,000 prime numbers. The proposed apparatus can increase the size of factorable numbers by 100 to 200 bits, and in particular can make 512 bit RSA keys (which protect 95% of today's E-commerce on the Internet) very vulnerable.
引用
收藏
页码:2 / 12
页数:11
相关论文
共 50 条