Paper 2007/208
RC4 State Information at Any Stage Reveals the Secret Key
Goutam Paul and Subhamoy Maitra
Abstract
A theoretical analysis of the RC4 Key Scheduling Algorithm (KSA) is presented in this paper, where the nonlinear operation is swapping among the permutation bytes. Explicit formulae are provided for the probabilities with which the permutation bytes at any stage of the KSA are biased to the secret key. Theoretical proofs of these formulae have been left open since Roos' work (1995). Next, a generalization of the RC4 KSA is analyzed corresponding to a class of update functions of the indices involved in the swaps. This reveals an inherent weakness of shuffle-exchange kind of key scheduling. We additionally show that each byte of
Note: Reorganized the paper for better clarity.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. SAC 2007
- Keywords
- BiasCryptanalysisKey RecoveryKey SchedulingPermutationRC4Stream Cipher.
- Contact author(s)
- subho @ isical ac in
- History
- 2009-01-09: last of 6 revisions
- 2007-06-05: received
- See all versions
- Short URL
- https://ia.cr/2007/208
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/208, author = {Goutam Paul and Subhamoy Maitra}, title = {{RC4} State Information at Any Stage Reveals the Secret Key}, howpublished = {Cryptology {ePrint} Archive, Paper 2007/208}, year = {2007}, url = {https://eprint.iacr.org/2007/208} }