New Results on the Key Scheduling Algorithm of RC4

  • Authors:
  • Mete Akgün;Pınar Kavak;Hüseyin Demirci

  • Affiliations:
  • Tübitak UEKAE, Gebze, Turkey 41470;Tübitak UEKAE, Gebze, Turkey 41470;Tübitak UEKAE, Gebze, Turkey 41470

  • Venue:
  • INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new bias is detected in the key scheduling algorithm of RC4 and a novel framework that advantageously combines this new bias with the existing ones is proposed. Using the new bias, a different algorithm is proposed to retrieve the RC4 key given the state table. The new method not only improves the success probability but also provides a more efficient way of calculation in comparison with the previous methods for any key size. The efficiency of the algorithm is demonstrated experimentally. If the key length is 40 bits, the secret key is retrieved with a 99% success rate in 0.007 seconds. The success probability for retrieving the 128 bit RC4 key is also increased significantly. 128-bit key can be retrieved with 3% success rate in 185 seconds and 7.45% success rate in 1572 seconds on a 2.67GHz Intel CPU.