Weaknesses in the Key Scheduling Algorithm of RC4
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
A Practical Attack on Broadcast RC4
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Attacks on the RC4 stream cipher
Designs, Codes and Cryptography
ISC '08 Proceedings of the 11th international conference on Information Security
Key Collisions of the RC4 Stream Cipher
Fast Software Encryption
Passive-only key recovery attacks on RC4
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Breaking 104 Bit WEP in less than 60 seconds
WISA'07 Proceedings of the 8th international conference on Information security applications
RC4-hash: a new hash function based on RC4
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
A failure-friendly design principle for hash functions
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
A new class of RC4 colliding key pairs with greater hamming distance
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
A new practical key recovery attack on the stream cipher RC4 under related-key model
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
How to find short RC4 colliding key pairs
ISC'11 Proceedings of the 14th international conference on Information security
| Hi-index | 0.00 |
In this paper, we discovered that RC4 can generate colliding key pairs with various hamming distances, other than those found by Matsui (with hamming distance one), and by Chen and Miyaji (with hamming distance three). We formalized RC4 colliding key pairs into two large patterns, namely, Transitional pattern and Self-Absorbing pattern, according to the behavior during KSA. The colliding key pairs found in the previous researches can be seen as either subsets of the Transitional pattern or of the Self-Absorbing pattern. We analyzed both patterns and clarified the relations among the probability of key collision, key length and hamming distances which yield the colliding key pairs. Also we show how to make use of the RC4 key collision patterns to find collisions of RC4-Hash function which was proposed in INDOCRYPT 2006. Some concrete experimental results (RC4-Hash collision and RC4 colliding key pairs) are also given in this paper.