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 条
  • [41] A SIMPLE DEVICE FOR WASHING LARGE NUMBERS OF SECTIONS AND TISSUES
    MOREE, R
    STAIN TECHNOLOGY, 1954, 29 (01): : 27 - 28
  • [42] On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Extended abstract)
    Kikuchi, Y
    Shibata, Y
    COMPUTING AND COMBINATORICS, 2001, 2108 : 400 - 408
  • [43] Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (extended abstract)
    Mizuki, T
    Nishizeki, T
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 196 - 207
  • [44] An Method of Factoring Large Integers
    Shaohua Zhang Gongliang Chen Zhongping Qin Xinrong Yan (Wuhan Maritime Communications Research Institute
    CSIC. School of Information Security Engineering of Shanghai Jiaotong University College of Software in Huazhong University of Science and Technology)
    信息安全与通信保密, 2005, (07) : 108 - 109
  • [45] FACTORING WITH 2 LARGE PRIMES
    LENSTRA, AK
    MANASSE, MS
    MATHEMATICS OF COMPUTATION, 1994, 63 (208) : 785 - 798
  • [46] FACTORING WITH 2 LARGE PRIMES
    LENSTRA, AK
    MANASSE, MS
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 473 : 72 - 82
  • [47] A new quick public key crypto-system based on the difficulty of factoring very large numbers
    Xiao, Y
    Li, LY
    DCABES 2001 PROCEEDINGS, 2001, : 230 - 233
  • [48] Proposal of the Multivariate Public Key Cryptosystem Relying on the Difficulty of Factoring a Product of Two Large Prime Numbers
    Tsujii, Shigeo
    Tadaki, Kohtaro
    Fujita, Ryo
    Gotaishi, Masahito
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (01): : 66 - 72
  • [49] METHODS OF FACTORING LARGE INTEGERS
    WAGSTAFF, SS
    SMITH, JW
    LECTURE NOTES IN MATHEMATICS, 1987, 1240 : 281 - 303
  • [50] Incremental Frequent Subgraph Mining on Large Evolving Graphs (Extended abstract)
    Abdelhamid, Ehab
    Canim, Mustafa
    Sadoghi, Mohammad
    Bhattacharjee, Bishwaranjan
    Chang, Yuan-Chi
    Kalnis, Panos
    2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2018, : 1767 - 1768