Scribd
Upload
8 views31 pages

Unit 2 Part 4

The document discusses the fundamentals of encryption, focusing on the Feistel cipher and its principles, including diffusion and confusion to enhance security. It outlines the structure of the Feistel cipher, key parameters, and the Data Encryption Standard (DES), emphasizing the importance of rounds, key size, and substitution boxes. Additionally, it highlights the significance of the avalanche effect and design principles for block ciphers to resist cryptanalysis.

Uploaded by

3atntv9hpx
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 views31 pages

Unit 2 Part 4

The document discusses the fundamentals of encryption, focusing on the Feistel cipher and its principles, including diffusion and confusion to enhance security. It outlines the structure of the Feistel cipher, key parameters, and the Data Encryption Standard (DES), emphasizing the importance of rounds, key size, and substitution boxes. Additionally, it highlights the significance of the avalanche effect and design principles for block ciphers to resist cryptanalysis.

Uploaded by

3atntv9hpx
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
You are on page 1/ 31

Types of Encryption

Feistal Cipher Basics

Plain Text MONKEY

Substitution (Replacing) NPOLFZ

Permutation(Rearranging) ONKEYM
Diffusion Vs Confusion ( To prevent
cryptanalysis)
● In diffusion, the statistical structure of the plaintext is dissipated into
long-range statistics of the ciphertext.
● This is achieved by having each plaintext digit affect the value of many
ciphertext digits; generally, this is equivalent to having each ciphertext digit be
affected by many plaintext digits.

● Confusion seeks to make the relationship between the statistics of the


ciphertext and the value of the encryption key as complex as possible, again to
thwart attempts to discover the key
Single Round of Fiestel Encryption
Key Points
1. Inputs - plaintext block of length 2w bits and a key K.
2. The plaintext block is divided into two halves,LE0 and RE0.
3. The two halves of the data pass through n rounds of processing and then
combine to produce the ciphertext block.
4. Each round i has as inputs LEi-1 and REi-1 derived from the previous round, as
well as a subkey Ki derived from the overall K.
5. Each round has a different key.
6. All rounds have the same structure.
Main Parameters
1. Block size - Larger size means better security
2. Key size: Larger key size means greater security but may decrease encryption/
decryption speed.
3. Number of rounds: The essence of the Feistel cipher is that a single round
offers inadequate security but that multiple rounds offer increasing security. A
typical size is 16 rounds.
4. Subkey generation algorithm: Greater complexity in this algorithm should lead
to greater difficulty of cryptanalysis.
5. Round function F: Again, greater complexity generally means greater
resistance to cryptanalysis.
Feistel Cipher Decryption
Data Encryption
Standard (DES)
Key Points
1. Symmetric Encryption Algorithm
2. DES is a block cipher and encrypts data in blocks of size of 64 bits each,
which means 64 bits of plain text go as the input to DES, which produces 64
bits of ciphertext.
3. The same algorithm and key are used for encryption and decryption, with
minor differences.
4. The key length is 56 bits.
DES Encryption
Feistel Function 1 0 1 1 0 0 0 0 1 1 1 1

1 1 1 1 1 0 1 1 0 0 0 0

0 0 0 0 1 1 1 1 1 0 1 1
Avalanche Effect

● A desirable property of any encryption algorithm is that a small change in


either the plaintext or the key should produce a significant change in the
ciphertext.
● In particular, a change in one bit of the plaintext or one bit of the key should
produce a change in many bits of the ciphertext.
Strength Of DES - Use of 56 bit keys
2. Use of Substitution Boxes
● The focus of concern has been on the eight substitution tables, or S-boxes,
that are used in each iteration.
● Because the design criteria for these boxes, and indeed for the entire
algorithm, were not made public, there is a suspicion that the boxes were
constructed in such a way that cryptanalysis is possible for an opponent who
knows the weaknesses in the S-boxes.
● Despite all this no one has so far succeeded in discovering the supposed fatal
weaknesses in the S-boxes.
3. Resilient against Timing Attack
A timing attack is 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.

A timing attack exploits the fact that an encryption or decryption algorithm often
takes slightly different amounts of time on different inputs.
Block Cipher Design Principles

Number of Rounds (More rounds more secure)

● The cryptographic strength of a Feistel cipher derives from three aspects of


the design: the number of rounds, the function F, and the key schedule
algorithm. Let us look first at the choice of the number of rounds.
● The greater the number of rounds, the more difficult it is to perform
cryptanalysis, even for a relatively weak F.
● In general, the criterion should be that the number of rounds is chosen so that
known cryptanalytic efforts require greater effort than a simple brute-force key
search attack. This criterion was certainly used in the design of DES.
Block Cipher Design Principles

Design of Feistel Function F

● It must be difficult to “unscramble” the substitution performed by F. One


obvious criterion is that F be nonlinear.
● have good avalanche properties (Strict Avalanche Criterion)
● Bit independence criterion (BIC), which states that output bits j and k should
change independently when any single input bit i is inverted for all i, j, and k.
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
● at minimum, the key schedule should guarantee key/ciphertext Strict
Avalanche Criterion and Bit Independence Criterion.

You might also like