Scribd
Upload
8 views21 pages

Overview of Data Encryption Standard (DES)

The Data Encryption Standard (DES) is a widely used symmetric key encryption scheme adopted in 1976, utilizing a 64-bit data block and a 56-bit key based on a Feistel Network. Despite its historical significance, DES is now considered insecure due to vulnerabilities such as brute-force and cryptanalysis attacks, leading to its planned replacement by the Advanced Encryption Standard (AES). The design principles of DES include confusion and diffusion to enhance security, but its key size and algorithmic nature raise concerns for modern applications.

Uploaded by

Vinit Pansuriya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views21 pages

Overview of Data Encryption Standard (DES)

The Data Encryption Standard (DES) is a widely used symmetric key encryption scheme adopted in 1976, utilizing a 64-bit data block and a 56-bit key based on a Feistel Network. Despite its historical significance, DES is now considered insecure due to vulnerabilities such as brute-force and cryptanalysis attacks, leading to its planned replacement by the Advanced Encryption Standard (AES). The design principles of DES include confusion and diffusion to enhance security, but its key size and algorithmic nature raise concerns for modern applications.

Uploaded by

Vinit Pansuriya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Data Encryption Standard (DES)

From Classical Ciphers to Modern Ciphers

Classical Cipher Modern Cipher (Block cipher)


 Alphabetic letters  Binary data
 Easy to do
 Large block size, large key space
 How?
 How substitution should be specified?
 Reasonable key length

Solution in a nutshell
 Substitution + Transposition + Feistel Network
Illustrate Solution with DES design
An exercise before we start
n-bit block
 Number of all possible plaintext?
 Number of all possible mapping?
 Number of keys needed?
 Required key length?
K-bit key
 How many possible keys?
An example
Encryption/
decryption mapping
can be defined by a
tabulation
Ideal block cipher
Maximum number of
possible encryption
mapping
Each mapping
constitutes the key
Block Cipher Principle
Design a symmetric key cryptographic
scheme with enough security
 Using a reasonable large block size
 Against frequency analysis
 With a reasonable size key
 Against to brute-force attack where the attackers may search
through all possible keys.
Block Cipher Principle
Solution
 Basic idea
 Confusion and Diffusion
 Feistel Network
 Product ciphers use the two classical encryption
forms: substitution and transposition, alternatively in
multiple rounds to achieve both confusion and
diffusion respectively
Feistel Network

Design
features/parameters
 Block size
 Key size
 Number of rounds
 Subkey generation algorithm
 Round function (F)
Feistel Network

The process of decryption


with a Feistel cipher is
essentially the same as the
encryption process.
Rule:
 Use the ciphertext as input
to the algorithm, but use the
subkeys in the reverse order
DES Overview
Data Encryption Standard (DES)
 Most widely used encryption scheme
 Adopted as Federal Information Processing Standard
(FIPS) for the United States in 1976
 64-bit data block
 56-bit key
 Based on Feistel Network
 The decryption follows the same process as the encryption.
 Now considered insecure for many applications
 To be replaced by AES
DES Structure
Initial Permutation and Inverse Initial Permutation
IP and FP have almost no cryptographic significance, included in
order to facilitate loading blocks in and out of mid-1970s hardware,
as well as to make DES run slower in software.
IP
Single Round
Expansion (E) and Permutation (P)
S-Box
S-box definition
Sub-key Generation
Permutation Choice

Note:
Only 56 bits
Are used
Avalanche Effect
A desirable property of an encryption algorithm is
that a small change in either the plaintext or the
key should produce a significant changes in
ciphertext.
Demo
 [Link]
 [Link]
aphy/[Link]
DES
DES is considered insecure for many applications
Concerns
 Key size
 Nature of the algorithm
Attacks
 Brute-force attack
 Linear cryptanalysis
 Differential cryptanalysis
 Timing attack

You might also like