This preview shows pages 1–9. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.1 CSE565: S. Upadhyaya Lec 3.1 CSE565: Computer Security Lectures 3 & 4 Block Ciphers and Data Encryption Standard Shambhu Upadhyaya Computer Science & Eng. University at Buffalo Buffalo, New York 14260 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.2 CSE565: S. Upadhyaya Lec 3.2 Overview Block Ciphers 10 minutes Description of DES 55 minutes Encryption Algorithm (Initial Permutation, Key Transformation, Expansion Permutation, SBox, P Box, Final Permutation) Decryption Algorithm Security of DES 10 minutes Cryptanalysis Linear, Differential & Related key 10 minutes DES Variants 5 minutes (some slides adapted from Lawrie Brown) 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.3 CSE565: S. Upadhyaya Lec 3.3 Modern Block Ciphers Study of modern block ciphers One of the most widely used types of cryptographic algorithms In particular will introduce DES (Data Encryption Standard) We will study AES later 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.4 CSE565: S. Upadhyaya Lec 3.4 SPermutation Ciphers Shannon observed that two weak but complementary ciphers can be made more secure by applying them together Product cipher (Apply E1 and then E2) In 1949 Shannon introduced idea of substitutionpermutation (S P) networks modern substitutiontransposition product cipher This forms the basis of modern block ciphers SP networks are based on the two primitive cryptographic operations we have seen before: substitution (Sbox) permutation (Pbox) Provide confusion and diffusion of message 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.5 CSE565: S. Upadhyaya Lec 3.5 Confusion and Diffusion Cipher needs to completely obscure statistical properties of original message A onetime pad does this More practically Shannon suggested combining elements to obtain: Diffusion dissipates statistical structure of plaintext over bulk of ciphertext Confusion makes relationship between ciphertext and key as complex as possible 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.6 CSE565: S. Upadhyaya Lec 3.6 Feistel Cipher Structure Horst Feistel devised the Feistel cipher based on concept of invertible product cipher Partitions input block into two halves process through multiple rounds perform a substitution on left data half this is based on applying a round function to the right half & subkey and take the ExOR then have permutation swapping halves Implements Shannons substitutionpermutation network concept 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.7 CSE565: S. Upadhyaya Lec 3.7 Feistel Cipher Structure 9/07/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 3.8 CSE565: S. Upadhyaya Lec 3.8 Feistel Cipher Design Principles Block size increasing size improves security, but slows cipher Key size increasing size improves security, makes exhaustive key searching...
View
Full
Document
This note was uploaded on 10/12/2010 for the course CSE 565 taught by Professor Shambhu during the Fall '09 term at SUNY Buffalo.
 Fall '09
 shambhu
 Computer Security

Click to edit the document details