SlideShare a Scribd company logo
Block Cipher and the
data encryption
standard (DES)
Lecture slides
By
Rasha
Content
 Block Cipher Principles
 The Data Encryption Standard
 DES Details
 DES Design Issues and Attacks
The objectives
 now look at 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
Cryptography Classification
 The old encryption and decryption techniques before the
implementation of computer system are called classical techniques ,
with implementation computer are called modern techniques.
 However , cryptography system (classical or modern ) are generally
classified along three independent dimensions:
1- type of operations : used for transforming plaintext to ciphertext .
all encryption algorithm are based on general principle:
a) substitution
b) transposition
c) bit manipulation
Cryptography Classification
2- Number of keys used
a) symmetric: if the same key is used by both the sender and receiver
for encryption and decryption it might be called single key ,secret key,
conventional encryption.
b) asymmetric: each sender and receiver using different key.
3- The way in which plaintext processed
a) block cipher: the input massage is divided in the blocks of elements
and each block is processes at a time ,producing an output block for
input.
b)stream cipher :the input elements are processed individually ,
producing an output as one element at a time too.
Block Ciphers
 Encrypt data one block at a time
 „Used in broader range of applications
 „Typical block size 64 – 128 bits 128 bits
 „Most algorithms based on a structure referred to as
Feistel block cipher
Block vs Stream Ciphers
Block cipher principles
 n-bit block cipher takes n bit plaintext and produces n bit ciphertext
 2n possible different plaintext blocks
 Encryption must be reversible (decryption possible)
 Each plaintext block must produce unique ciphertext block
 Total transformations is 2n!
Ideal Block Cipher
key is mapping ; Key length 16 × 4 bits = 64 bits . i.e. concatenate all bits of ciphertext table
Encryption/decryption table
Ideal Block Cipher
 n-bit input maps to 2n possible input states
 Substitution used to produce 2n output states
 Output states map to n-bit output
 Ideal block cipher allows maximum number of possible encryption mappings from
plaintext block
 Problems with ideal block cipher:
– Small block size: equivalent to classical substitution cipher; cryptanalysis based
on statistical characteristics feasible
– Large block size: key must be very large; performance/implementation problems
 Key length :
– In general, key length is 2n × n
– „Actual block size is at least 64 bit ( „Key length will be 264× 64 ≈ 1021 „bits)
Feistel Structure for Block Ciphers
 Feistel proposed applying two or more simple ciphers in sequence so final result
cryptographically stronger than component ciphers
 n-bit block length; k-bit key length; 2k transformations (rather than 2n !)
 Feistel cipher alternates: substitutions, transpositions (permutations)
 Applies concepts of diffusion and confusion
 Applied in many ciphers today
 Approach:
– Plaintext split into halves
– Subkeys (or round keys) generated from key
– Round function, F, applied to right half
– Apply substitution on left half using XOR
– Apply permutation: interchange to halves
 implements Shannon’s S-P net concept
Feistel Cipher Structure
Confusion and Diffusion
 Diffusion
– Statistical nature of plaintext is reduced in ciphertext
– E.g. A plaintext letter affects the value of many ciphertext letters
– How: repeatedly apply permutation (transposition) to data, and
then apply function
 Confusion
– Make relationship between ciphertext and key as complex as
possible
– Even if attacker can find some statistical characteristics of
ciphertext, still hard to find key
Using the Feistel Structure
 Exact implementation depends on various design features
 Block size, e.g. 64, 128 bits: larger values leads to more diffusion
 Key size, e.g. 128 bits: larger values leads to more confusion, resistance
against brute force
 Number of rounds, e.g. 16 rounds
 Subkey generation algorithm: should be complex
 Round function F: should be complex
 Other factors include fast encryption in software and ease of
analysis
Feistel Example
Data Encryption Standard (DES)
 Symmetric block cipher
– 56-bit key, 64-bit input block, 64-bit output block
 One of most used encryption systems in world
– Developed in 1977 by NBS/NIST
– Designed by IBM (Lucifer) with input from NSA
– Principles used in other ciphers, e.g. 3DES, IDEA.
DES
Encryption
Algorithm
Permutation Tables for DES
3: Expansion permutation (E )
4 : Permutation Function (P)
Permutation Tables for DES
Single Round of DES Algorithm
21
DES Round Structure
Definition of DES S-Boxes
Definition of DES S-Boxes
DES Key Schedule Calculation
25
Table
3.2
DES
Example
Note: DES subkeys are shown as eight 6-bit values in hex format
(Table can be found on
page 75 in textbook)
DES Example
Avalanche Effect
 Aim: small change in key (or plaintext) produces large change in ciphertext
 Avalanche effect is present in DES (good for security)
 Following examples show the number of bits that change in output when two
different inputs are used, differing by 1 bit
– Plaintext 1: 02468aceeca86420
– Plaintext 2: 12468aceeca86420
– Ciphertext difference: 32 bits
– Key 1: 0f1571c947d9e859
– Key 2: 1f1571c947d9e859
– Ciphertext difference: 30
Table 3.3 Avalanche Effect in DES: Change in Plaintext
Table 3.4 Avalanche Effect in DES: Change in Key
Table 3.5
Average Time Required for Exhaustive Key Search
Key size
 Although 64 bit initial key, only 56 bits used in
encryption (other 8 for parity check)
 256 = 7.2 x 1016
– Today: 56 bits considered too short to
withstand brute force attack
 3DES uses 128-bit keys
Attacks on DES
 Timing Attacks
– Information gained about key/plaintext by observing how
long implementation takes to decrypt
– No known useful attacks on DES
 Differential Cryptanalysis
– Observe how pairs of plaintext blocks evolve
– Break DES in 247 encryptions (compared to 255); but
require 247 chosen plaintexts
 Linear Cryptanalysis
– Find linear approximations of the transformations
– Break DES using 243 known plaintexts
DES Algorithm Design
 DES was designed in private; questions about the
motivation of the design
– S-Boxes provide non-linearity: important part
of DES, generally considered to be secure
– S-Boxes provide increased confusion
– Permutation P chosen to increase diffusion
Summary
 have considered:
– block vs stream ciphers
– Feistel cipher design & structure
– DES
» details
» strength

More Related Content

PPT
block ciphers
PDF
Triple Data Encryption Standard (t-DES)
PPT
Diffie-hellman algorithm
PPTX
Diffie hellman key exchange algorithm
PPTX
PPTX
Idea(international data encryption algorithm)
PDF
Introduction to Cryptography
PPTX
Advanced encryption standard (aes)
block ciphers
Triple Data Encryption Standard (t-DES)
Diffie-hellman algorithm
Diffie hellman key exchange algorithm
Idea(international data encryption algorithm)
Introduction to Cryptography
Advanced encryption standard (aes)

What's hot (20)

PPTX
Data Encryption Standard (DES)
PPT
Symmetric & Asymmetric Cryptography
PPTX
Diffie Hellman Key Exchange
PPTX
IP Security
PPTX
Cryptography & Steganography
PPTX
Cryptography
PDF
Introduction to Neural Networks
PPTX
Modern symmetric cipher
PPTX
Association rules
PDF
Computer Security Lecture 7: RSA
PPTX
Introduction to cryptography and types of ciphers
PPTX
Double DES & Triple DES
PPT
DES (Data Encryption Standard) pressentation
PDF
AES-Advanced Encryption Standard
PPTX
Security services and mechanisms
PPTX
steganography
PPTX
Cryptography
PPT
Security Attacks.ppt
PPTX
Cryptographic Hashing Functions
PPTX
Cryptography - Block cipher & stream cipher
Data Encryption Standard (DES)
Symmetric & Asymmetric Cryptography
Diffie Hellman Key Exchange
IP Security
Cryptography & Steganography
Cryptography
Introduction to Neural Networks
Modern symmetric cipher
Association rules
Computer Security Lecture 7: RSA
Introduction to cryptography and types of ciphers
Double DES & Triple DES
DES (Data Encryption Standard) pressentation
AES-Advanced Encryption Standard
Security services and mechanisms
steganography
Cryptography
Security Attacks.ppt
Cryptographic Hashing Functions
Cryptography - Block cipher & stream cipher
Ad

Similar to Information and data security block cipher and the data encryption standard (des) (20)

PPT
4255596.ppt
PPT
chap03.ppt- Cryptography and Network security
PPTX
PPT
Unit II.ppt.............................
PPTX
Module 1-Block Ciphers and the Data Encryption Standard.pptx
PDF
chap3.pdf
PDF
sheet4.pdf
PDF
paper4.pdf
PDF
lecture3.pdf
PDF
doc4.pdf
PDF
doc4.pdf
PPTX
data encryption standard under the subtopic cryptography and network security
PPTX
Block Ciphers and DES.pptx
PPT
Block Cipher Stream Cipher DESUnit 3.ppt
PPT
data encryption standard algorithm in cryptography by william stallings
PPTX
Block ciphers & public key cryptography
PDF
Block Ciphers and the Data Encryption Standard
PPT
DES-lecture (1).ppt
PPT
PPT
ch03 network security in computer sys.ppt
4255596.ppt
chap03.ppt- Cryptography and Network security
Unit II.ppt.............................
Module 1-Block Ciphers and the Data Encryption Standard.pptx
chap3.pdf
sheet4.pdf
paper4.pdf
lecture3.pdf
doc4.pdf
doc4.pdf
data encryption standard under the subtopic cryptography and network security
Block Ciphers and DES.pptx
Block Cipher Stream Cipher DESUnit 3.ppt
data encryption standard algorithm in cryptography by william stallings
Block ciphers & public key cryptography
Block Ciphers and the Data Encryption Standard
DES-lecture (1).ppt
ch03 network security in computer sys.ppt
Ad

More from Mazin Alwaaly (20)

PPTX
Pattern recognition voice biometrics
PPTX
Pattern recognition palm print authentication system
PPTX
Pattern recognition on line signature
PPTX
Pattern recognition multi biometrics using face and ear
PPTX
Pattern recognition IRIS recognition
PPT
Pattern recognition hand vascular pattern recognition
PPTX
Pattern recognition Hand Geometry
PPTX
Pattern recognition forensic dental identification
PPT
Pattern recognition fingerprints
PPTX
Pattern recognition facial recognition
PPTX
Pattern recognition ear as a biometric
PPTX
Pattern recognition 3d face recognition
PPTX
Multimedia multimedia over wireless and mobile networks
PPT
Multimedia network services and protocols for multimedia communications
PPTX
Multimedia content based retrieval in digital libraries
PPTX
Multimedia lossy compression algorithms
PPTX
Multimedia lossless compression algorithms
PPTX
Multimedia basic video compression techniques
PPT
Multimedia image compression standards
PPTX
Multimedia fundamental concepts in video
Pattern recognition voice biometrics
Pattern recognition palm print authentication system
Pattern recognition on line signature
Pattern recognition multi biometrics using face and ear
Pattern recognition IRIS recognition
Pattern recognition hand vascular pattern recognition
Pattern recognition Hand Geometry
Pattern recognition forensic dental identification
Pattern recognition fingerprints
Pattern recognition facial recognition
Pattern recognition ear as a biometric
Pattern recognition 3d face recognition
Multimedia multimedia over wireless and mobile networks
Multimedia network services and protocols for multimedia communications
Multimedia content based retrieval in digital libraries
Multimedia lossy compression algorithms
Multimedia lossless compression algorithms
Multimedia basic video compression techniques
Multimedia image compression standards
Multimedia fundamental concepts in video

Recently uploaded (20)

PPTX
ognitive-behavioral therapy, mindfulness-based approaches, coping skills trai...
PPTX
DRUG THERAPY FOR SHOCK gjjjgfhhhhh.pptx.
PPTX
Derivatives of integument scales, beaks, horns,.pptx
PDF
VARICELLA VACCINATION: A POTENTIAL STRATEGY FOR PREVENTING MULTIPLE SCLEROSIS
PDF
An interstellar mission to test astrophysical black holes
PPTX
Vitamins & Minerals: Complete Guide to Functions, Food Sources, Deficiency Si...
PPTX
Protein & Amino Acid Structures Levels of protein structure (primary, seconda...
PDF
Mastering Bioreactors and Media Sterilization: A Complete Guide to Sterile Fe...
PDF
The scientific heritage No 166 (166) (2025)
DOCX
Q1_LE_Mathematics 8_Lesson 5_Week 5.docx
PPTX
EPIDURAL ANESTHESIA ANATOMY AND PHYSIOLOGY.pptx
PPTX
BIOMOLECULES PPT........................
PDF
. Radiology Case Scenariosssssssssssssss
PPTX
famous lake in india and its disturibution and importance
PPTX
2. Earth - The Living Planet Module 2ELS
PDF
Unveiling a 36 billion solar mass black hole at the centre of the Cosmic Hors...
PPTX
ECG_Course_Presentation د.محمد صقران ppt
PPTX
The KM-GBF monitoring framework – status & key messages.pptx
PPT
POSITIONING IN OPERATION THEATRE ROOM.ppt
PPTX
Classification Systems_TAXONOMY_SCIENCE8.pptx
ognitive-behavioral therapy, mindfulness-based approaches, coping skills trai...
DRUG THERAPY FOR SHOCK gjjjgfhhhhh.pptx.
Derivatives of integument scales, beaks, horns,.pptx
VARICELLA VACCINATION: A POTENTIAL STRATEGY FOR PREVENTING MULTIPLE SCLEROSIS
An interstellar mission to test astrophysical black holes
Vitamins & Minerals: Complete Guide to Functions, Food Sources, Deficiency Si...
Protein & Amino Acid Structures Levels of protein structure (primary, seconda...
Mastering Bioreactors and Media Sterilization: A Complete Guide to Sterile Fe...
The scientific heritage No 166 (166) (2025)
Q1_LE_Mathematics 8_Lesson 5_Week 5.docx
EPIDURAL ANESTHESIA ANATOMY AND PHYSIOLOGY.pptx
BIOMOLECULES PPT........................
. Radiology Case Scenariosssssssssssssss
famous lake in india and its disturibution and importance
2. Earth - The Living Planet Module 2ELS
Unveiling a 36 billion solar mass black hole at the centre of the Cosmic Hors...
ECG_Course_Presentation د.محمد صقران ppt
The KM-GBF monitoring framework – status & key messages.pptx
POSITIONING IN OPERATION THEATRE ROOM.ppt
Classification Systems_TAXONOMY_SCIENCE8.pptx

Information and data security block cipher and the data encryption standard (des)

  • 1. Block Cipher and the data encryption standard (DES) Lecture slides By Rasha
  • 2. Content  Block Cipher Principles  The Data Encryption Standard  DES Details  DES Design Issues and Attacks
  • 3. The objectives  now look at 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
  • 4. Cryptography Classification  The old encryption and decryption techniques before the implementation of computer system are called classical techniques , with implementation computer are called modern techniques.  However , cryptography system (classical or modern ) are generally classified along three independent dimensions: 1- type of operations : used for transforming plaintext to ciphertext . all encryption algorithm are based on general principle: a) substitution b) transposition c) bit manipulation
  • 5. Cryptography Classification 2- Number of keys used a) symmetric: if the same key is used by both the sender and receiver for encryption and decryption it might be called single key ,secret key, conventional encryption. b) asymmetric: each sender and receiver using different key. 3- The way in which plaintext processed a) block cipher: the input massage is divided in the blocks of elements and each block is processes at a time ,producing an output block for input. b)stream cipher :the input elements are processed individually , producing an output as one element at a time too.
  • 6. Block Ciphers  Encrypt data one block at a time  „Used in broader range of applications  „Typical block size 64 – 128 bits 128 bits  „Most algorithms based on a structure referred to as Feistel block cipher
  • 7. Block vs Stream Ciphers
  • 8. Block cipher principles  n-bit block cipher takes n bit plaintext and produces n bit ciphertext  2n possible different plaintext blocks  Encryption must be reversible (decryption possible)  Each plaintext block must produce unique ciphertext block  Total transformations is 2n!
  • 9. Ideal Block Cipher key is mapping ; Key length 16 × 4 bits = 64 bits . i.e. concatenate all bits of ciphertext table
  • 11. Ideal Block Cipher  n-bit input maps to 2n possible input states  Substitution used to produce 2n output states  Output states map to n-bit output  Ideal block cipher allows maximum number of possible encryption mappings from plaintext block  Problems with ideal block cipher: – Small block size: equivalent to classical substitution cipher; cryptanalysis based on statistical characteristics feasible – Large block size: key must be very large; performance/implementation problems  Key length : – In general, key length is 2n × n – „Actual block size is at least 64 bit ( „Key length will be 264× 64 ≈ 1021 „bits)
  • 12. Feistel Structure for Block Ciphers  Feistel proposed applying two or more simple ciphers in sequence so final result cryptographically stronger than component ciphers  n-bit block length; k-bit key length; 2k transformations (rather than 2n !)  Feistel cipher alternates: substitutions, transpositions (permutations)  Applies concepts of diffusion and confusion  Applied in many ciphers today  Approach: – Plaintext split into halves – Subkeys (or round keys) generated from key – Round function, F, applied to right half – Apply substitution on left half using XOR – Apply permutation: interchange to halves  implements Shannon’s S-P net concept
  • 14. Confusion and Diffusion  Diffusion – Statistical nature of plaintext is reduced in ciphertext – E.g. A plaintext letter affects the value of many ciphertext letters – How: repeatedly apply permutation (transposition) to data, and then apply function  Confusion – Make relationship between ciphertext and key as complex as possible – Even if attacker can find some statistical characteristics of ciphertext, still hard to find key
  • 15. Using the Feistel Structure  Exact implementation depends on various design features  Block size, e.g. 64, 128 bits: larger values leads to more diffusion  Key size, e.g. 128 bits: larger values leads to more confusion, resistance against brute force  Number of rounds, e.g. 16 rounds  Subkey generation algorithm: should be complex  Round function F: should be complex  Other factors include fast encryption in software and ease of analysis
  • 17. Data Encryption Standard (DES)  Symmetric block cipher – 56-bit key, 64-bit input block, 64-bit output block  One of most used encryption systems in world – Developed in 1977 by NBS/NIST – Designed by IBM (Lucifer) with input from NSA – Principles used in other ciphers, e.g. 3DES, IDEA.
  • 20. 3: Expansion permutation (E ) 4 : Permutation Function (P) Permutation Tables for DES
  • 21. Single Round of DES Algorithm 21
  • 23. Definition of DES S-Boxes
  • 24. Definition of DES S-Boxes
  • 25. DES Key Schedule Calculation 25
  • 26. Table 3.2 DES Example Note: DES subkeys are shown as eight 6-bit values in hex format (Table can be found on page 75 in textbook)
  • 28. Avalanche Effect  Aim: small change in key (or plaintext) produces large change in ciphertext  Avalanche effect is present in DES (good for security)  Following examples show the number of bits that change in output when two different inputs are used, differing by 1 bit – Plaintext 1: 02468aceeca86420 – Plaintext 2: 12468aceeca86420 – Ciphertext difference: 32 bits – Key 1: 0f1571c947d9e859 – Key 2: 1f1571c947d9e859 – Ciphertext difference: 30
  • 29. Table 3.3 Avalanche Effect in DES: Change in Plaintext
  • 30. Table 3.4 Avalanche Effect in DES: Change in Key
  • 31. Table 3.5 Average Time Required for Exhaustive Key Search
  • 32. Key size  Although 64 bit initial key, only 56 bits used in encryption (other 8 for parity check)  256 = 7.2 x 1016 – Today: 56 bits considered too short to withstand brute force attack  3DES uses 128-bit keys
  • 33. Attacks on DES  Timing Attacks – Information gained about key/plaintext by observing how long implementation takes to decrypt – No known useful attacks on DES  Differential Cryptanalysis – Observe how pairs of plaintext blocks evolve – Break DES in 247 encryptions (compared to 255); but require 247 chosen plaintexts  Linear Cryptanalysis – Find linear approximations of the transformations – Break DES using 243 known plaintexts
  • 34. DES Algorithm Design  DES was designed in private; questions about the motivation of the design – S-Boxes provide non-linearity: important part of DES, generally considered to be secure – S-Boxes provide increased confusion – Permutation P chosen to increase diffusion
  • 35. Summary  have considered: – block vs stream ciphers – Feistel cipher design & structure – DES » details » strength