The RC4 stream cipher is the most widely used software based stream cipher. It is based on a secret internal state of N = 256 bytes and two pointers. This paper proposes an efficient algorithm to compute a special set of RC4 states named non-fortuitous predictive states. These special states increase the probability to guess part of the internal state in a known plaintext attack and present a cryptanalytic weakness of RC4. The problem of designing a practical algorithm to compute them has been open since it was posed by Mantin and Shamir in 2001. We also formally prove a slightly corrected version of the conjecture by Mantin and Shamir of 2001 that only a known elements along with the two pointers at any RC4 round cannot predict more than a outputs in the next N rounds. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Paul, S., & Preneel, B. (2003). Analysis of non-fortuitous predictive states of the RC4 keystream generator. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2904, 52–67. https://doi.org/10.1007/978-3-540-24582-7_4
Mendeley helps you to discover research relevant for your work.