DES supplement.

Slides:



Advertisements
Similar presentations
Conventional Encryption: Algorithms
Advertisements

ECE454/CS594 Computer and Network Security Dr. Jinyuan (Stella) Sun Dept. of Electrical Engineering and Computer Science University of Tennessee Fall 2011.
Cryptography and Network Security Chapter 3
Public Key Encryption Algorithm
BY MUKTADIUR RAHMAN MAY 06, 2010 INTERODUCTION TO CRYPTOGRAPHY.
1 Overview of the DES A block cipher: –encrypts blocks of 64 bits using a 64 bit key –outputs 64 bits of ciphertext A product cipher –basic unit is the.
Lecture 2.2: Private Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.
Computer Security CS 426 Lecture 3
Cryptanalysis. The Speaker  Chuck Easttom  
History and Background Part 1: Basic Concepts and Monoalphabetic Substitution CSCI 5857: Encoding and Encryption.
The Data Encryption Standard - see Susan Landau’s paper: “Standing the test of time: the data encryption standard.” DES - adopted in 1977 as a standard.
Lecture 19 Page 1 CS 111 Online Symmetric Cryptosystems C = E(K,P) P = D(K,C) E() and D() are not necessarily the same operations.
David Evans CS200: Computer Science University of Virginia Computer Science Lecture 12: Decrypting Work Circle Fractal.
Network Security Lecture 11 Presented by: Dr. Munam Ali Shah.
CS526: Information Security Prof. Sam Wagstaff September 16, 2003 Cryptography Basics.
Based on Bruce Schneier Chapter 7: Key Length Dulal C. Kar.
CSCI 5857: Encoding and Encryption
Strength of Cryptographic Systems Dr. C F Chong, Dr. K P Chow Department of Computer Science and Information Systems The University of Hong Kong.
DES Attacks and Triple DES
1 Public-Key Cryptography and Message Authentication.
The RSA Algorithm. Content Review of Encryption RSA An RSA example.
6fb52297e004844aa81be d50cc3545bc Hashing!. Hashing  Group Activity 1:  Take the message you were given, and create your own version of hashing.  You.
DES Analysis and Attacks CSCI 5857: Encoding and Encryption.
Linear Cryptanalysis of DES
Conventional Encryption Chapter 4. Multiple DES Advantage of extra stages –Each stage gives 56 more bits of key length –Double DES subject to meet-in-the-middle.
Linear Cryptanalysis of DES M. Matsui. 1.Linear Cryptanalysis Method for DES Cipher. EUROCRYPT 93, 1994.Linear Cryptanalysis Method for DES Cipher 2.The.
Lecture 5 Page 1 CS 236 Online More on Cryptography CS 236 On-Line MS Program Networks and Systems Security Peter Reiher.
RSA Pubic Key Encryption CSCI 5857: Encoding and Encryption.
CST 312 Pablo Breuer. A block of plaintext is treated as a whole and used to produce a ciphertext block of equal length Typically a block size of 64 or.
@Yuan Xue 285: Network Security CS 285 Network Security Hash Algorithm Yuan Xue Fall 2012.
Cracking Encrypted Systems
CAP Cryptographic Analysis Program
Information Security and Management (Abstract) 5
Privacy & Security.
CSCE 715: Network Systems Security
What is network security?
Message Authentication and Hash Functions
Security.
Outline Desirable characteristics of ciphers Uses of cryptography
Symmetric Algorithm of Cryptography
History and Background Part 4: Transposition Ciphers
Introduction Of System Security
Outline Desirable characteristics of ciphers Uses of cryptography
Lecture 3: Symmetric Key Encryption
Cryptography after DES
MAC: Message Authentication Code
Cryptography Lecture 18.
مروري برالگوريتمهاي رمز متقارن(كليد پنهان)
Cryptography II Jagdish S. Gangolly School of Business
Unit 2 “Implementation of a RC5 block cipher algorithm and implementing an attack on it”
Rivest, Shamir and Adleman
Security.
csci5233 computer security & integrity (Chap. 4)
Security Of Wireless Sensor Networks
MSIT 543 Cryptography Concepts and Techniques Symmetric Key Encryption
Outline Using cryptography in networks IPSec SSL and TLS.
Cryptanalysis of C2 Lee, Jae-song Cryptanalysis of C2.
Confusion and Diffusion
SYMMETRIC ENCRYPTION.
Security of Wireless Sensor Networks
Introduction to Cryptography (1)
Lecture 4.1: Hash Functions, and Message Authentication Codes
Differential Cryptanalysis
Cryptography Lecture 16.
Cryptography Lecture 17.
Modern Cryptography.
Cryptanalysis Network Security.
CRYPTOGRAPHY & NETWORK SECURITY
Elect. Codebook, Cipher Block Chaining
Presentation transcript:

DES supplement

Why not 2DES? Why not C = E(E(P, K), K) ? Trick question --- it’s still just 56 bit key Why not C = E(E(P, K1), K2) ? D(C, K2) = D(E(E(P, K1), K2), K2) = E(P, K1) Not 2112 brute-force effort! A semi-practical known plaintext attack! Modern block ciphers are widely used to provide encryption of quantities of information, and/or a cryptographic checksum to ensure the contents have not been altered. We continue to use block ciphers because they are comparatively fast, and because we know a fair amount about how to design them. 2

Choosen Plaintext attack Short Procedures : Pre-compute table of E(P, K1) for every possible key K1 (sort the table has 256 entries table and remember key) For each possible K2 compute D(C, K2), look up in the table until a match in table is found When match is found, have E(P, K1) = D(C, K2) Result gives us keys: C = E(E(P, K1), K2) Only takes twice as long to break double DES using brute force! 2 x 256 = 257 Modern block ciphers are widely used to provide encryption of quantities of information, and/or a cryptographic checksum to ensure the contents have not been altered. We continue to use block ciphers because they are comparatively fast, and because we know a fair amount about how to design them. 3

3DES (TDEA) : 3 keys C = E(D(E(P, K1), K2), K3) Key size= 256x256x256 = 2168 Meet in the middle attack 2112 effort –too much Modern block ciphers are widely used to provide encryption of quantities of information, and/or a cryptographic checksum to ensure the contents have not been altered. We continue to use block ciphers because they are comparatively fast, and because we know a fair amount about how to design them. 4

3DES (TDEA) : 2 keys C = E(D(E(P, K1), K2), K1) Key size= 256x256 = 2112 Known-plaintext attack with effort 256, but requires 256 ⟨m,c⟩ pairs! Modern block ciphers are widely used to provide encryption of quantities of information, and/or a cryptographic checksum to ensure the contents have not been altered. We continue to use block ciphers because they are comparatively fast, and because we know a fair amount about how to design them. 5