Key Collisions of the RC4 Stream Cipher

FAST SOFTWARE ENCRYPTION(2009)

引用 41|浏览1
暂无评分
摘要
This paper studies "colliding keys" of RC4 that create the same initial state and hence generate the same pseudo-random byte stream. It is easy to see that RC4 has colliding keys when its key size is very large, but it was unknown whether such key collisions exist for shorter key sizes. We present a new state transition sequence of the key scheduling algorithm for a related key pair of an arbitrary fixed length that can lead to key collisions and show as an example a 24-byte colliding key pair. We also demonstrate that it is very likely that RC4 has a colliding key pair even if its key size is less than 20 bytes. This result is remarkable in that the number of possible initial states of RC4 reaches 256! ≈ 21684. In addition we present a 20-byte near-colliding key pair whose 256-byte initial state arrays differ at only two byte positions.
更多
查看译文
关键词
key collisions,colliding key,key collision,24-byte colliding key pair,shorter key size,key size,rc4 stream cipher,rc4 reach,key scheduling algorithm,colliding key pair,20-byte near-colliding key pair,related key pair,stream cipher,state transition,scheduling algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要