Scribd
Upload
94 views

This Is The Basis Structure For Block Cipher. DES Encryption and Decryption Algorithms Uses This Structure. This Structure Proposed by Feistel

The document discusses the Data Encryption Standard (DES) block cipher. It describes the Feistel cipher structure that DES is based on, including that it uses a 64-bit block size, 56-bit key size, and 16 rounds. The DES algorithm involves an initial and final permutation, followed by 16 rounds of applying the mangler/F function to halves of the block using 48-bit round keys generated from the main key. The F function includes expansion, XOR with round key, substitution via S-boxes, and transposition.

Uploaded by

Naga sai Challa
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
94 views

This Is The Basis Structure For Block Cipher. DES Encryption and Decryption Algorithms Uses This Structure. This Structure Proposed by Feistel

The document discusses the Data Encryption Standard (DES) block cipher. It describes the Feistel cipher structure that DES is based on, including that it uses a 64-bit block size, 56-bit key size, and 16 rounds. The DES algorithm involves an initial and final permutation, followed by 16 rounds of applying the mangler/F function to halves of the block using 48-bit round keys generated from the main key. The F function includes expansion, XOR with round key, substitution via S-boxes, and transposition.

Uploaded by

Naga sai Challa
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/ 12

Data Encryption Standard

05 March 2022 07:34

Feistel Cipher Structure:-

○ This is the basis structure for Block Cipher.

○ DES Encryption and Decryption algorithms uses this structure.

○ This structure proposed by Feistel.

Feistel Structure Design Features:-

3CSE-A CNS Page 1


○ Block Size:
Traditionally, a block size of 64 bits(used by DES) has been
considered a reasonable trade-off and nearly universal in block
cipher design. However, the new AES uses 128 bit block size.

○ Key Size:
Key sizes 64 bits or less are now widely considered to be
inadequate, and 128 bits has become common size.

○ Number Of Rounds:
The essence of Feistel Cipher is that a single round offers
inadequate security but that multiple rounds offer increasing
security. A typical size is 16 rounds.

○ Subkey generation Algorithm:


Greater complexity in this algorithm should lead to greater
difficulty of cryptanalysis.

○ Round function F :
Again, greater complexity generally means greater resistance to
cryptanalysis.

Data Encryption Standard (DES) :-

○ The Data Encryption Standard (DES) is a symmetric - key Block Cipher


published by National Institute of Standards and Technology(NIST) in
1975.
3CSE-A CNS Page 2
1975.

Overview of DES:-

○ DES is a block cipher.

○ It is also known as Data Encryption Algorithm.

○ DES Features :-

▪ Input Block Size : 64 bits

▪ Output Block Size : 64 bits

▪ Key - Size : 56 Bits (In Reality, the key size is 64 - Bits (8 Bytes), But 8
Bits are used as Parity check for error control).

▪ Number Of Rounds : 16 rounds

▪ Round Key size : 48 Bits

3CSE-A CNS Page 3


DES Structure :- (At Encryption Site)

○ Encryption process is made of two permutations (P-boxes), which we


call initial and final permutations, and 16 Feistel rounds.

○ Initial and Final Permutations:-

▪ The initial and final permutations are straight P-boxes that are
inverse of each other. They have no cryptography significance in
DES.

3CSE-A CNS Page 4


○ A single round in DES (Encryption Site) :-

3CSE-A CNS Page 5


▪ After performing initial permutation, input block(64 Bit length) is
divided into two equal parts and each part has a length of 32 Bits.

Left Half Right Half

▪ Now, Apply Mangler Function (F) on Right Half.

▪ Mangler Function (F) uses the following steps

 Step1 :- Expansion Permutations (using P - Boxes)


In order to match with length of round key (48 Bits),
Right Half (32 Bits) is expanded to 48 Bits.

 Step2 :- Now XOR operation in between Right Half i.e the


result of step1 (48 Bits) and Round Key (48 Bits).

 Step3 :- Now, the result of step2 is reduced to 32 Bit length by


applying Keyed Substitution technique (Using S-Boxes).

 Step4 :- Now, Apply transposition (Changing the positions of


Bits) of step3.

3CSE-A CNS Page 6


 Step5 :- Now, Apply XOR operation in between left Half (32 Bit)
and the result of step4 (32 Bit).

▪ In general Left Half i and Right Half i as follows

○ DES Function (Mangler Function or F Function):-

▪ The heart of DES is Mangler function (DES function).

▪ It is operated on Right Part (32 - Bit length).

▪ The following are the steps involved in DES function (Mangler


function)

 Expansion Permutation (P - Boxes)

 XOR operations

 Keyed Substitution (S - Boxes).

 Transposition (P - Boxes)

3CSE-A CNS Page 7


▪ Expansion Permutation (P - Box):-

□ It takes 32 - Bit input convert into 48 Bits.

□ Now, Right Part (32 - Bit) is divided into 8 4-bit sections.

□ Now, each 4-bit section is expanded to 6 - Bits. This expansion follows


a predetermined rule.

□ For, each section, input bits 1, 2, 3 and 4 are copied to output bits
2,3,4,5 respectively. Out bit 1 comes from bit 4 of previous section,
out bit 6 comes from bit 1 of the next section.

▪ XOR Operations:-

After the expansion permutation, DES uses the XOR operation on


the expanded right section (48 Bits) and the round key (48 Bit
length).

▪ Keyed Substitution (S Boxes):-

□ It takes 32 - Bit input convert into 48 Bits

3CSE-A CNS Page 8


□ Now, Right Part (48 - Bit) is divided into 8 6-bit sections.

□ Now, each 6-bit section is converted to 4 - Bits.

□ S - Boxes are used for converting 6 Bit Section to 4 Bit section.

□ Let us consider the following example

 S - Box 1:-

For example if the 6 Bit section is 101010 and it is converted


to 4 Bit section as 0110 by using the above S - Box1.

Procedure :-
For the given Input 101010, the first (1 [1]) and last (6 [0])
bits represents row of the S - Box1. And remaining bits
represents the column of the S - Box1.

3CSE-A CNS Page 9


10 (row) and 0101 (column) intersect at value 6.

So, S1 (101010) = 6 = 0110.

□ In this way, By using S - Boxes 48-Bit input is converted into 32 -


Bit length.

▪ Transposition (P - Box)):-

□ In this position of Bits(32 Bit Length) were changed.

○ Key Scheduling and Decryption in DES :-

▪ Original 64-bit key is permuted to 56-bit (8, 16, 24, ….,64 bits are
dropped)key.

▪ Left Circular Shift is 1 for rounds 1,2,9,16.

▪ Left Circular Shift is 2 for other rounds.

▪ And then 56 - Bit key is permuted to 48 - bit (By dropping 8 - Bits).

▪ DES Decryption:-

3CSE-A CNS Page 10


○ DES Analysis:-

▪ Avalanche effect in DES:-

 It is a desirable property of any encryption algorithm.

 What is an Avalanche effect?

If there is any one bit modification in input and key then the
output should be varying in many number of bits.

 DES has Strong Avalanche effect.

◊ 1 bit change in plain text - 34 bits changes in ciphertext on


average.
◊ 1 bit change in key - 35 bits changes in ciphertext on average.

▪ Completeness effect :-

Completeness effect means that each bit of the ciphertext needs


to depend on many bits on the plaintext.

Strengths of DES:-
3CSE-A CNS Page 11
○ Strengths of DES:-

The use of 56 bit keys

The Nature of DES algorithm

Very effective towards Timing Attacks

3CSE-A CNS Page 12

You might also like