Scribd
Upload
3 views

Lecture 5

The document discusses symmetric key encryption, focusing on block ciphers, particularly the Feistel cipher structure and the Data Encryption Standard (DES). It outlines the principles of substitution and transposition, the design and operation of DES, its vulnerabilities, and the evolution towards the Advanced Encryption Standard (AES). The document also covers different modes of operation for DES and highlights its weaknesses and the transition to more secure encryption methods.

Uploaded by

sibav63587
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views

Lecture 5

The document discusses symmetric key encryption, focusing on block ciphers, particularly the Feistel cipher structure and the Data Encryption Standard (DES). It outlines the principles of substitution and transposition, the design and operation of DES, its vulnerabilities, and the evolution towards the Advanced Encryption Standard (AES). The document also covers different modes of operation for DES and highlights its weaknesses and the transition to more secure encryption methods.

Uploaded by

sibav63587
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Agenda

 Symmetric Key Encryption (Block Ciphers)


 Feistel Cipher Structure
 DES
Block Cipher
Block Cipher

 All encryption algorithms based on two general principles


 Substitution: Each element in the plain text is mapped into
another element. (Confusion)
 Transposition: Elements in the plaintext are rearranged.
(Diffusion)
 Multiple stages of substitution & transposition
Block Cipher

 Block ciphers based on Feistel Cipher


 Basic requirement is that it must be able to decrypt
ciphertext to recover messages efficiently
 For n bits block there must be 2n possible different
plaintext blocks and for the encryption it should be
reversible
 Block ciphers look like an extremely large substitution
Block Cipher

 Cipher needs to completely obscure statistical properties of


original message
 a one-time pad does this
 More practically Shannon suggested combining S & P
elements to obtain:
 diffusion – drive away statistical structure of plaintext over
bulk of ciphertext
 confusion – makes relationship between ciphertext and key
as complex as possible
Feistel Cipher Structure

 Horst Feistel devised the Feistel cipher


 Invertible product cipher
 Based on substitution & permutation
 Partitions input block into two halves
 Process through multiple rounds which perform a
substitution on left data half based on round function of
right half & subkey then have permutation swapping halves
 Implements Shannon’s S-P concept (1945)
Feistel Cipher Structure
Feistel Cipher Structure

 Block size
 Key size
 Number of rounds
 Subkey generation algorithm
 Round function
 Fast software en/decryption
 Ease of analysis
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 bit
 performs both substitution and transposition (permutation)
on the bits
 Cipher consists of 16 rounds (iterations) each with a round
key generated from the user-supplied key
 http://kathrynneugent.com/animation.html
DES (Key Scheduling)

key
 48 Bit Round Key
PC-1

C0 D0

LSH LSH
PC-2 K1

C1 D1

LSH LSH
PC-2 K16
DES (Encryption) input

IP

L0 R0

 f K1

L1 = R0 R1 = L0  f(R0 , K1)

R16 = L15 ­ f(R15, K16) L16 = R15

Ğ1
IP

output
DES (Encryption)

R iĞ1(32 bits) Ki (48 bits)

R iĞ1(48 bits)  6 bits into each

S1 S2 S3 S4 S5 S6 S7 S8

4 bits out of each

32 bits
DES (Controversy)

 Considered too weak


 Diffie, Hellman said in a few years technology would allow
DES to be broken in days
 Design using 1999 technology published
 Design decisions not public
 S-boxes may have backdoors
DES (Controversy)

 4 weak keys
 They are their own inverses
 12 semi-weak keys
 Each has another semi-weak key as inverse
 Complementation property
 DESk(m) = c  DESk(m) = c
 S-boxes exhibit irregular properties
 Distribution of odd, even numbers non-random
 Outputs of fourth box depends on input to third box
DES (Modes)

 Electronic Code Book Mode (ECB)


 Encipher each block independently
 Cipher Block Chaining Mode (CBC)
 Xor each block with previous ciphertext block
 Requires an initialization vector for the first one
 Encrypt-Decrypt-Encrypt Mode (2 keys: k, k)
 c = DESk(DESk–1(DESk(m)))
 Encrypt-Encrypt-Encrypt Mode (3 keys: k, k, k)
 c = DESk(DESk (DESk(m)))
CBC Mode Encryption

init. vector m1 m2 …

 
DES DES …

c1 c2 …

sent sent
Slide #8-
17

CBC Mode Decryption

init. vector c1 c2 …

DES DES …

 
m1 m2 …
Slide #8-
18

Self-Healing Property

 Initial message
 3231343336353837 3231343336353837 3231343336353837 3231343336353837
 Received as (underlined 4c should be 4b)
 ef7c4cb2b4ce6f3b f6266e3a97af0e2c 746ab9a6308f4256

33e60b451b09603d
 Which decrypts to
 efca61e19f4836f1 3231333336353837 3231343336353837

3231343336353837
 Incorrect bytes underlined
 Plaintext “heals” after 2 blocks
Slide #8-
19

Current Status of DES

 Design for computer system, associated software


that could break any DES-enciphered message in a
few days published in 1998
 Several challenges to break DES messages solved
using distributed computing
 NIST selected Rijndael as Advanced Encryption
Standard, successor to DES
 Designed to withstand attacks that were successful on DES

You might also like