A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Practical Cryptography for Data Internetworks
Practical Cryptography for Data Internetworks
FPGA '03 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays
Experience Using a Low-Cost FPGA Design to Crack DES Keys
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Security and Privacy Issues in E-passports
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Attacking elliptic curve cryptosystems with special-purpose hardware
Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
A Survey of Lightweight-Cryptography Implementations
IEEE Design & Test
Special-Purpose Hardware for Solving the Elliptic Curve Discrete Logarithm Problem
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Collision Search for Elliptic Curve Discrete Logarithm over GF(2m) with FPGA
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Experiments on the Multiple Linear Cryptanalysis of Reduced Round Serpent
Fast Software Encryption
Breaking Legacy Banking Standards with Special-Purpose Hardware
Financial Cryptography and Data Security
A Real-World Attack Breaking A5/1 within Hours
CHES '08 Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoq Code Hopping Scheme
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
High-Speed Search System for PGP Passphrases
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
A generic framework to enforce access control in FPGAs with dynamic reconfiguration
SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
Improving the time complexity of Matsui's linear cryptanalysis
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Improved meet-in-the-middle attacks on reduced-round DES
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
E-Passport: cracking basic access control keys
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Efficient implementation of elliptic curve cryptography using low-power digital signal processor
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Sparse Boolean equations and circuit lattices
Designs, Codes and Cryptography
FPGA implementation of a statistical saturation attack against PRESENT
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Implementation and evaluation of an SCA-resistant embedded processor
CARDIS'11 Proceedings of the 10th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
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
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
GPU-Acceleration of block ciphers in the OpenSSL cryptographic library
ISC'12 Proceedings of the 15th international conference on Information Security
Cryptanalytic attacks on MIFARE classic protocol
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
On bruteforce-like cryptanalysis: new meet-in-the-middle attacks in symmetric cryptanalysis
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
A hardware-accelerated ECDLP with high-performance modular multiplication
International Journal of Reconfigurable Computing - Special issue on Selected Papers from the 2011 International Conference on Reconfigurable Computing and FPGAs (ReConFig 2011)
| Hi-index | 0.00 |
Cryptanalysis of symmetric and asymmetric ciphers is computationally extremely demanding. Since the security parameters (in particular the key length) of almost all practical crypto algorithms are chosen such that attacks with conventional computers are computationally infeasible, the only promising way to tackle existing ciphers (assuming no mathematical breakthrough) is to build special-purpose hardware. Dedicating those machines to the task of cryptanalysis holds the promise of a dramatically improved cost-performance ratio so that breaking of commercial ciphers comes within reach. This contribution presents the design and realization of the COPACOBANA (Cost-Optimized Parallel Code Breaker) machine, which is optimized for running cryptanalytical algorithms and can be realized for less than US$ 10,000. It will be shown that, depending on the actual algorithm, the architecture can outperform conventional computers by several orders in magnitude. COPACOBANA hosts 120 low-cost FPGAs and is able to, e.g., perform an exhaustive key search of the Data Encryption Standard (DES) in less than nine days on average. As a real-world application, our architecture can be used to attack machine readable travel documents (ePass). COPACOBANA is intended, but not necessarily restricted to solving problems related to cryptanalysis. The hardware architecture is suitable for computational problems which are parallelizable and have low communication requirements. The hardware can be used, e.g., to attack elliptic curve cryptosystems and to factor numbers. Even though breaking full-size RSA (1024 bit or more) or elliptic curves (ECC with 160 bit or more) is out of reach with COPACOBANA, it can be used to analyze cryptosystems with a (deliberately chosen) small bitlength to provide reliable security estimates of RSA and ECC by extrapolation.