This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Unit 3  20 RC4 Initialization Let us denote the secret key of length N as key[i] for i = 0, 1, . .. , N −1, so that each key[i] represents one byte, and the lookup table as S[i], where each S[i] is also a byte. A Keybased initialization Algorithm appears as: for i = 0 to 255 S[ i ] = i K[ i ] = key[ i mod N ] next i j = 0 for i = 0 to 255 j = (j + S [ i ] + K [ i ] ) mod 256 swap( S [ i ], S [ j ]) next i i = j = 0...
View
Full
Document
This note was uploaded on 03/17/2011 for the course ECE 4472 taught by Professor Ouda during the Fall '10 term at UWO.
 Fall '10
 Ouda
 Information Security

Click to edit the document details