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: To encrypt, the plaintext P is split into left and right halves, For each round i = 1, 2, . . . , n new left and right halves are computed according to the rule K i is the subkey for round i . The subkey is derived from the key K according to a key schedule algorithm . Finally, the ciphertext C is the output of the final round P = (L , R ) L i = R i −1 R i = L i −1 ⊕ F(R i −1 , K i ) C = (L n , R n )...
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
- Information Security