Fast, FPGA-based Rainbow Table creation for attacking encrypted mobile communications

Fast, FPGA-based Rainbow Table creation for attacking encrypted mobile communications
复制标题

基于 FPGA 的快速彩虹表​​创建,用于攻击加密的移动通信

DOI:
10.1109/fpl.2013.6645525
复制
发表时间:
2013
期刊:
2013 23rd International Conference on Field programmable Logic and Applications
影响因子:
--
通讯作者:
C. Manifavas
C. Manifavas
中科院分区:
--
文献类型:
--
作者:
Panagiotis Papantonakis;D. Pnevmatikatos;I. Papaefstathiou;C. Manifavas

文献摘要

被引文献

相似文献

在移动的通信系统中使用的加密算法自从被引入以来一直受到攻击,并且这些攻击中的许多在实际设置中已经成功。一个这样的例子,在GSM中使用的A5/1,被使用“彩虹表”攻击,即预先计算的表,在破解代码时,为了运行时效率而牺牲长时间的离线计算和大存储。传统上,Rainbow Tables用于反转密码散列。它们对A5/1的适用开辟了一个新的利用领域。在本文中,我们提出了一种基于FPGA的架构,用于A5/3分组密码,用于第二代和第三代移动的通信系统的有效创建彩虹表。总的目标是提取加密密钥,前提是我们有一个在已知明文攻击下的密文块。所提出的架构利用了Rainbow Table创建过程中的并行性,并使用Virtext 5 LX 330 T分别为1个和64个计算引擎实现了约9倍和550倍的加速。我们表明,由于我们的实验设置中的可用内存有限,我们的方法实现了高成功率的关键空间减少到242。然后,我们演示了如何无缝扩展所提出的架构,以有效地为整个键空间创建更大的彩虹表。
Encryption algorithms utilized in mobile communication systems have been under attack since their introduction, and many of these attacks have been successful in practical settings. One such example, A5/1 used in GSM, was attacked using “Rainbow Tables”, i.e. pre-computed tables that trade long offline computation and large storage for runtime efficiency when cracking the code. Traditionally, Rainbow Tables were used to reverse password hashes. Their application against A5/1 opened up a new domain of exploitation. In this paper, we present an FPGA-based architecture for the efficient creation of Rainbow Tables for the A5/3 block cipher that is used in 2nd and 3rd generation mobile communication systems. The overall goal is to extract the encryption key, provided we have a ciphertext block under a known plaintext attack. The presented architecture exploits the parallelism in the Rainbow Table creation process, and using a Virtext5 LX330T achieves speedups around 9x and 550x for one and 64 compute engines respectively. We show that due to the limited available memory in our experimental setup, our approach achieves high success rates for a key space reduced to 242. We then demonstrate how we can seamlessly extend the proposed architecture to efficiently create much larger Rainbow Tables for the full key-space.