Scribd
Upload
74 views

Chapter 3 - Block Ciphers and The Data Encryption Standard

The document discusses block ciphers and the Data Encryption Standard (DES). It explains that block ciphers encrypt messages in blocks, whereas stream ciphers encrypt messages bit-by-bit. DES is the most widely used block cipher, encrypting 64-bit blocks using a 56-bit key. DES and most modern block ciphers are based on the Feistel cipher structure, which partitions the input block into halves and performs multiple rounds of processing using subkeys.

Uploaded by

rishabhdubey
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
74 views

Chapter 3 - Block Ciphers and The Data Encryption Standard

The document discusses block ciphers and the Data Encryption Standard (DES). It explains that block ciphers encrypt messages in blocks, whereas stream ciphers encrypt messages bit-by-bit. DES is the most widely used block cipher, encrypting 64-bit blocks using a 56-bit key. DES and most modern block ciphers are based on the Feistel cipher structure, which partitions the input block into halves and performs multiple rounds of processing using subkeys.

Uploaded by

rishabhdubey
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 15

Chapter 3 – Block Ciphers and

the Data Encryption Standard


Modern Block Ciphers
 one of the most widely used types of
cryptographic algorithms
 provide secrecy /authentication services
 focus on DES (Data Encryption Standard)
 to illustrate block cipher design principles
 most symmetric block ciphers are based on
a Feistel Cipher Structure
Block vs Stream Ciphers
 block ciphers process messages in blocks,
each of which is then en/decrypted
 like a substitution on very big characters
 64-bits or more
 stream ciphers process messages a bit or
byte at a time when en/decrypting
 many current ciphers are block ciphers
 broader range of applications
Feistel Cipher Structure
 Horst Feistel devised the feistel cipher
 Based on the concept of product cipher
 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
Feistel Cipher Structure
Feistel Cipher Design Elements
 block size
 key size
 number of rounds
 subkey generation algorithm
 round function
 fast software en/decryption
 ease of analysis
Feistel Cipher Decryption
Data Encryption Standard (DES)
 most widely used block cipher in world
 adopted in 1977 by NBS (now NIST)
 as FIPS PUB 46
 encrypts 64-bit data using 56-bit key
 has widespread use
DES Encryption Overview
Initial Permutation IP
 first step of the data computation
 IP reorders the input data bits
 even bits to LH half, odd bits to RH half
 quite regular in structure (easy in h/w)
DES Round Structure
 uses two 32-bit L & R halves
 as for any Feistel cipher can describe as:
Li = Ri–1
Ri = Li–1 ⊕ F(Ri–1 , Ki)
 F takes 32-bit R half and 48-bit subkey:
 expands R to 48-bits using perm E
 adds to subkey using XOR
 passes through 8 S-boxes to get 32-bit result
 finally permutes using 32-bit perm P
DES Round Structure
DES Key Schedule
 forms subkeys used in each round
 initial permutation of the key (PC1) which
selects 56-bits in two 28-bit halves
 16 stages consisting of:
• rotating each half separately either 1 or 2 places
depending on the key rotation schedule K
• selecting 24-bits from each half & permuting them
by PC2 for use in round function F
 note practical use issues in h/w vs s/w
DES Decryption
 decrypt must unwind steps of data computation
 with Feistel design, do encryption steps again
using subkeys in reverse order (SK16 … SK1)
 IP undoes final FP step of encryption

1st round with SK16 undoes 16th encrypt round

….
 16th round with SK1 undoes 1st encrypt round
 then final FP undoes initial encryption IP
 thus recovering original data value
Strength of DES – Key Size
 56-bit keys have 256 = 7.2 x 1016 values
 brute force search looks hard
 recent advances have shown is possible
 in 1997 on Internet in a few months

in 1998 on dedicated h/w (EFF) in a few days
 in 1999 above combined in 22hrs!
 still must be able to recognize plaintext
 must now consider alternatives to DES

You might also like