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: Why not C = E(E(P,K 1 ),K 2 ) ? A (semi-practical) known plaintext attack Precompute table of E(P,K 1 ) for every possible key K 1 (resulting table has 2 56 entries) Then for each possible K 2 compute D(C,K 2 ) until a match in table is found When match is found, have E(P,K 1 ) = D(C,K 2 ) Result is keys: C = E(E(P,K 1 ),K 2 ) 3DES...
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