Scribd
Upload
9 views2 pages

RC4 - UpdatedExample

The document provides a simplified example of the RC4 stream cipher using an 8 x 3-bit state vector and a 4 x 3-bit key. It details the initialization of the state and temporary vectors, the initial permutation process, and the generation of ciphertext by XORing the plaintext with the generated key. The example illustrates the step-by-step operations involved in the RC4 encryption process.

Uploaded by

2594708686
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views2 pages

RC4 - UpdatedExample

The document provides a simplified example of the RC4 stream cipher using an 8 x 3-bit state vector and a 4 x 3-bit key. It details the initialization of the state and temporary vectors, the initial permutation process, and the generation of ciphertext by XORing the plaintext with the generated key. The example illustrates the step-by-step operations involved in the RC4 encryption process.

Uploaded by

2594708686
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Computer Security

RC4

1 Simplified RC4 Example


Lets consider the stream cipher RC4, but instead of the full 256 bytes, we will use 8 x 3-bits. That
is, the state vector S is 8 x 3-bits. We will operate on 3-bits of plaintext at a time since S can take
the values 0 to 7, which can be represented as 3 bits.

Assume we use a 4 x 3-bit key of K = [1 2 3 6]. And a plaintext P = [1 2 2 2]

The first step is to generate the stream.

Initialize the state vector S and temporary vector T. S is initialized so the S[i] = i, and T is
initialized so it is the key K (repeated as necessary).

S = [0 1 2 3 4 5 6 7]
T = [1 2 3 6 1 2 3 6]

Now perform the initial permutation on S.


j = 0;
for i = 0 to 7 do
j = (j + S[i] + T[i]) mod 8
Swap(S[i],S[j]);
end

For i = 0:
j = (0 + 0 + 1) mod 8
= 1
Swap(S[0],S[1]);

S = [1 0 2 3 4 5 6 7]

For i = 1:
j=3
Swap(S[1],S[3])
S = [1 3 2 0 4 5 6 7];

For i = 2:
j=0
Swap(S[2],S[0]);
S = [2 3 1 0 4 5 6 7];

For i = 3:
j = 6;
Swap(S[3],S[6])
S = [2 3 1 6 4 5 0 7];

Simplified RC4 1
Computer Security

For i = 4:
j=3
Swap(S[4],S[3])
S = [2 3 1 4 6 5 0 7];

For i = 5:
j=2
Swap(S[5],S[2]);
S = [2 3 5 4 6 1 0 7];

For i = 6:
j = 5;
Swap(S[6],S[4])
S = [2 3 5 4 0 1 6 7];

For i = 7:
j = 2;
Swap(S[7],S[2])
S = [2 3 7 4 0 1 6 5];

Hence, our initial permutation of S = [2 3 7 4 0 1 6 5];

Now we generate 3-bits at a time, k, that we XOR with each 3-bits of plaintext to produce the
ciphertext. The 3-bits k is generated by:

i, j = 0;
while (true) {
i = (i + 1) mod 8;
j = (j + S[i]) mod 8;
Swap (S[i], S[j]);
t = (S[i] + S[j]) mod 8;
k = S[t]; }

The first iteration:


S = [2 3 7 4 0 1 6 5]
i = (0 + 1) mod 8 = 1
j = (0 + S[1]) mod 8 = 3
Swap(S[1],S[3])
S = [2 4 7 3 0 1 6 5]
t = (S[1] + S[3]) mod 8 = 7
k = S[7] = 5

Remember, P = [1 2 2 2]

So our first 3-bits of ciphertext is obtained by: k XOR P


5 XOR 1 = 101 XOR 001 = 100 = 4

Continue…

Simplified RC4 2

You might also like