The quadratic sieve factoring algorithm
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Special-Purpose Hardware in Cryptanalysis: The Case of 1,024-Bit RSA
IEEE Security and Privacy
Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Factorization of a 512-bit RSA modulus
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Analysis and optimization of the TWINKLE factoring device
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
The traveling beams optical solutions for bounded NP-complete problems
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Application of bio-inspired algorithm to the problem of integer factorisation
International Journal of Bio-Inspired Computation
The ForwardDiffsig scheme for multicast authentication
IEEE/ACM Transactions on Networking (TON)
PET SNAKE: a special purpose architecture to implement an algebraic attack in hardware
Transactions on computational science X
An optical system for prime factorization based on parallel processing
OSC'10 Proceedings of the Third international conference on Optical supercomputing
An optical solution for the SAT Problem
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Scalable hardware for sparse systems of linear equations, with applications to integer factorization
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Analysis on the clockwise transposition routing for dedicated factoring devices
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Solving binary linear equation systems over the rationals and binaries
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Cryptanalysis of the Full AES Using GPU-Like Special-Purpose Hardware
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
On the strength comparison of the ECDLP and the IFP
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Hi-index | 0.00 |
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 can 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.