Unit 3-Symmetric Key Crypto_Part10

Unit 3-Symmetric - 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

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Unit 3 - 19 RC4, cont. RC4 uses an arrangement of the numbers 0 to 255 (8 bits each) in an array S which changes over time S is a self-modifying lookup table It consists of two processes A Key-based initialization Algorithm to set up the initial permutation of S based on secret key. A pseudo-random generation algorithm to Swaps elements in current lookup table Selects a keystream byte from table Note that: Each step of RC4 produces a byte, while each step of A5/1 produces only a bit
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the 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 Key-based 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.

Page1 / 2

Unit 3-Symmetric - 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

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online