Efficient Reconstruction of RC4 Keys from Internal States

  • Authors:
  • Eli Biham;Yaniv Carmeli

  • Affiliations:
  • Computer Science Department, Technion --- Israel Institute of Technology, Haifa, Israel 3200;Computer Science Department, Technion --- Israel Institute of Technology, Haifa, Israel 3200

  • Venue:
  • Fast Software Encryption
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present an efficient algorithm for the retrieval of the RC4 secret key, given an internal state. This algorithm is several orders of magnitude faster than previously published algorithms. In the case of a 40-bit key, it takes only about 0.02 seconds to retrieve the key, with success probability of 86.4%. Even if the algorithm cannot retrieve the entire key, it can retrieve partial information about the key. The key can also be retrieved if some of the bytes of the initial permutation are incorrect or missing.