Scribd
Upload
76 views

Cryptography and Network Security: Sixth Edition by William Stallings

The document discusses block ciphers and the Data Encryption Standard (DES). It explains the basic structure of block ciphers including Feistel ciphers, and describes DES's encryption algorithm, key size, and strength against cryptanalysis. The document also outlines principles for designing block ciphers such as using multiple rounds, nonlinear round functions, and secure key schedules.

Uploaded by

Vo Minh Khanh (K14 HCM)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
76 views

Cryptography and Network Security: Sixth Edition by William Stallings

The document discusses block ciphers and the Data Encryption Standard (DES). It explains the basic structure of block ciphers including Feistel ciphers, and describes DES's encryption algorithm, key size, and strength against cryptanalysis. The document also outlines principles for designing block ciphers such as using multiple rounds, nonlinear round functions, and secure key schedules.

Uploaded by

Vo Minh Khanh (K14 HCM)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 24

Cryptography

and Network
Security
Sixth Edition
by William Stallings
Chapter 3
Block Ciphers and the Data
Encryption Standard
“All the afternoon Mungo had been working on
Stern's code, principally with the aid of the latest
messages which he had copied down at the Nevin
Square drop. Stern was very confident. He must be
well aware London Central knew about that drop. It
was obvious that they didn't care how often Mungo
read their messages, so confident were they in the
impenetrability of the code.”
—Talking to Strange Men,
Ruth Rendell
Stream Cipher
Block Cipher
Stream Cipher and
Block Cipher
Table 3.1
Encryption and Decryption Tables for Substitution Cipher of Figure 3.2
Feistel Cipher
• Proposed the use of a cipher that alternates
substitutions and permutations

• Is a practical application of a proposal by Claude


Shannon to develop a product cipher that alternates
confusion and diffusion functions
• Is the structure used by many significant symmetric
block ciphers currently in use
Diffusion and Confusion
• Terms introduced by Claude Shannon to capture the
two basic building blocks for any cryptographic system
• Shannon’s concern was to thwart cryptanalysis based
on statistical analysis
Feistel Cipher
Structure
Feistel Cipher Design
Features
• Block size
• Round function F
• Larger block sizes mean greater
• Greater complexity generally means
security but reduced
greater resistance to cryptanalysis
encryption/decryption speed for a
given algorithm • Fast software encryption/decryption
• Key size • In many cases, encrypting is
• Larger key size means greater embedded in applications or utility
functions in such a way as to
security but may decrease
encryption/decryption speeds preclude a hardware
implementation; accordingly, the
• Number of rounds speed of execution of the algorithm
becomes a concern
• The essence of the Feistel cipher is
that a single round offers inadequate • Ease of analysis
security but that multiple rounds
• If the algorithm can be concisely and
offer increasing security
clearly explained, it is easier to
• Subkey generation algorithm analyze that algorithm for
• Greater complexity in this algorithm cryptanalytic vulnerabilities and
therefore develop a higher level of
should lead to greater difficulty of
assurance as to its strength
cryptanalysis
Feistel Example
Data Encryption Standard (DES)
• Issued in 1977 by the National Bureau of Standards (now
NIST) as Federal Information Processing Standard 46
• Was the most widely used encryption scheme until the
introduction of the Advanced Encryption Standard (AES) in
2001
• Algorithm itself is referred to as the Data Encryption
Algorithm (DEA)
• Data are encrypted in 64-bit blocks using a 56-bit key
• The algorithm transforms 64-bit input in a series of steps into
a 64-bit output
• The same steps, with the same key, are used to reverse the
encryption
DES
Encryption
Algorithm
Table 3.2

DES
Example
(Table can be found on
page 75 in textbook)

Note: DES subkeys are shown as eight 6-bit values in hex format
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
Strength of DES
• Timing attacks
• One in which information about the key or the
plaintext is obtained by observing how long it takes
a given implementation to perform decryptions on
various ciphertexts
• Exploits the fact that an encryption or decryption
algorithm often takes slightly different amounts of
time on different inputs
• So far it appears unlikely that this technique will
ever be successful against DES or more powerful
symmetric ciphers such as triple DES and AES
Block Cipher Design Principles:
Number of Rounds
Block Cipher Design Principles:
Design of Function F
• The heart of a Feistel The algorithm should have good
block cipher is the avalanche properties
function F
• The more nonlinear F, the
more difficult any type of
cryptanalysis will be
•The SAC and BIC
criteria appear to
strengthen the
effectiveness of the
confusion function
Block Cipher Design Principles:
Key Schedule Algorithm
• With any Feistel block cipher, the key is used to
generate one subkey for each round
• In general, we would like to select subkeys to
maximize the difficulty of deducing individual
subkeys and the difficulty of working back to the
main key
• It is suggested that, at a minimum, the key
schedule should guarantee key/ciphertext Strict
Avalanche Criterion and Bit Independence
Criterion
Summary
• Traditional Block Cipher • The strength of DES
Structure • Use of 56-bit keys
• Stream ciphers • Nature of the DES
• Block ciphers algorithm
• Feistel cipher • Timing attacks

• The Data Encryption • Block cipher design


Standard (DES) principles
• Encryption • DES design criteria
• Decryption • Number of rounds
• Avalanche effect • Design of function F
• Key schedule algorithm

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy