This problem deals with the RC4 stream cipher.
a. Find a reasonable upper bound on the size of the RC4 state space.
That is, find an upper bound for the number of different states that are possible for the RC4 cipher. Hint: The RC4 cipher consists of a lookup table S, and two indices i and j . Count the number of possible distinct tables S and the number of distinct indices I and j , then compute the product of these numbers.
b. Why is the size of the state space relevant when analyzing a stream cipher?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here