Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/D8F76078-7852-4DB5-B820-FCDF9E8C53F6 | ||
| Year | 2012 | ||
| Type of Item | Conference Full Paper | ||
| License |
|
||
| Bibliographic Citation | D. Pnevmatikatos, I. Papaefstathiou, C. Manifavas, M. Kalenderi, "Breaking the GSM A5/1 cryptography algorithm with rainbow tables and high-end FPGAS," in 22nd International Conference on Field Programmable Logic and Applications (FPL), 2012, pp. 747 - 753. doi: 10.1109/FPL.2012.6339146 https://doi.org/10.1109/FPL.2012.6339146 | ||
| Appears in Collections |
A5 is the basic cryptographic algorithm used in GSM cell-phones to ensure that the user communication is protected against illicit acts. The A5/1 version was developed in 1987 and has since been under attack. The most recent attack on A5/1 is the “A51 security project”, led by Karsten Nohl that consists of the creation of rainbow tables that map the internal state of the algorithm with the keystream. Rainbow tables are efficient structures that allow the tradeoff between run-time (computations performed to crack a conversation) and space (memory to hold pre-computed information). In this paper we describe a very effective parallel architecture for the creation of the A5/1 rainbow tables in reconfigurable hardware. Rainbow table creation is the most expensive portion of cracking a particular encrypted information exchange. Our approach achieves almost 3000× speedup over a single processor, and 2.5× speedup compared to GPUs. This performance is achieved with less than 5 Watt power consumption, achieving an energy efficiency in the order of 150x better that the GPU approach.
Copyright © DIAS 2013
