The effectiveness of brute force attacks on RC4
The effectiveness of brute force attacks on RC4
复制标题
DOI：
10.1109/dnsr.2004.1344747
复制
发表时间：
2004-05
期刊：
影响因子：
--
通讯作者：
N. Couture;K. Kent
中科院分区：
文献类型：
--
作者：
N. Couture;K. Kent
加密算法的安全性在很大程度上取决于穷举密钥空间搜索的计算不可行性。我们使用主要用于数据通信领域的 RC4 密码作为测试用例，用于确定使用片上网络 (NoC) 设计架构在 FPGA 上实施的详尽密钥搜索的有效性。初步结果表明，使用 Celoxica DK2 设计工具在 Xilinx XC2V1000 FPGA 上实现的密钥检查器单元网络可以利用硬件的速度和并行性，从而可以在几分钟内搜索 40 位 RC4 加密的整个密钥空间。此外，已经发现电路的时钟速率随着密钥检查器单元数量的增加而减小。建议未来的工作寻找一种方法来预测网络大小（密钥检查器单元的数量）和时钟速率之间的最佳平衡，以便最大限度地提高性能。
The security of encryption algorithms depends heavily on the computational infeasibility of exhaustive key-space searches. We use the RC4 cipher, utilized primarily in the area of data communications, as a test case for determining the effectiveness of exhaustive key-searches implemented on FPGAs using a network on chip (NoC) design architecture. Preliminary results show that a network of key-checker units implemented on a Xilinx XC2V1000 FPGA using Celoxica DK2 design tools can exploit the speed and parallelism of hardware such that the entire key-space of a 40-bit RC4 encryption can be searched in minutes. Furthermore, it has been found that the clock rate of the circuit diminishes as the number of key-checker units increases. Future work is proposed to find a method for predicting an optimal balance between the size of the network (number of key-checker units) and the clock rate in order to maximize performance.