A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Analysis of Bernstein's Factorization Circuit
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Factoring Large Numbers with the Twinkle Device (Extended Abstract)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
Analysis and optimization of the TWINKLE factoring device
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
SHARK: a realizable special hardware sieving device for factoring 1024-bit integers
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
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
A simpler sieving device: combining ECM and TWIRL
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Practical Broadcast Authentication Using Short-Lived Signatures in WSNs
Information Security Applications
| Hi-index | 0.00 |
Discussion in asymmetric cryptography circles currently focuses on 1,024-bit RSA key security. Interestingly, in this discussion, a major argument put forward for the insecurity of 1,024-bit RSA isn't due to paramount theoretical progress but to hypothetical hardware devices for factoring large numbers. Unlike quantum computers, these special-purpose designs try to work within the bounds of existing technology; this article looks at the ideas underlying some of these designs and their potential.