0% found this document useful (0 votes)
6 views

4.1 DES (Data Encryption Standard) Algorithm

The document outlines the Data Encryption Standard (DES) algorithm, which is a symmetric block cipher that operates on 64-bit blocks using a 64-bit main key, 56-bit sub key, and 48-bit round key across 16 rounds. It describes the two main processes involved: obtaining ciphertext from plaintext and key generation, detailing procedures such as initial permutation, expansion permutation, S-boxes, and transposition P-box. Decryption follows the same steps as encryption but uses the keys in reverse order.

Uploaded by

adityapandji1
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
0% found this document useful (0 votes)
6 views

4.1 DES (Data Encryption Standard) Algorithm

The document outlines the Data Encryption Standard (DES) algorithm, which is a symmetric block cipher that operates on 64-bit blocks using a 64-bit main key, 56-bit sub key, and 48-bit round key across 16 rounds. It describes the two main processes involved: obtaining ciphertext from plaintext and key generation, detailing procedures such as initial permutation, expansion permutation, S-boxes, and transposition P-box. Decryption follows the same steps as encryption but uses the keys in reverse order.

Uploaded by

adityapandji1
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/ 14

4.

1 DES (Data Encryption Standard) Algorithm


-Mohd Janisar
Points to remember
• It’s a symmetric block cipher.
• Block because it works on a block of 64 bits.
• Symmetric because the same key is used to encrypt and decrypt data
• It takes Input of 64 bits
• Produces an Output of cipher text with 64 bits
• Has Main key of 64 bits
• Has Sub key of 56 bits
• Has Round key of 48 bits
• No. of rounds it takes is 16 rounds
Two processes in combination are basically involved in this algorithm

Process 1
Process 2
Steps to
Process
get
of key
ciphertext
generation
from plain
text
Four procedures to remember in
Process 1
• Initial Permutation
• 16 rounds : the process in every single round
• 32 bit swap function
• Inverse Initial permutation
Let’s see them one by one….
Initial Permutation :
In simple words, permutation is the process
wherein positions of bits are changed with some
logic. The logic here is…
After initial permutation, 64 bits plain text is
divided into 2 parts of 32 bits as left half and
right half and then round process begins.

Single round process includes :


step 1)Expansion permutation
step 2)keyed substitutions (8 s boxes)
step 3)Transposition P-box
step 4)Right half XOR with left half
The entire process is called as Mangler
function
1

Lets see each step from single round individually….


The expansion permutation is expanding 32 bits to 48 bits as it has to match with the 48 bit
key for XORing, So this extends 32 bits to 48 bits with some logic as follows:

Original 32 bit data Permuted 48 bit data


S-boxes (8 s boxes)

Expansion Permutation

6 bits x 8
48 bits after XOR boxes =48
bits (6 bit
input)
4 bits x 8
boxes =32
bits(4 bit
output)
Box S1

row cols

Value 6 is the value coming at the intersection of row and column


Transposition P Box :
• Transposition P Box is to again change the positions of 32 bits
received from s- boxes with permutations
• This in turn returns right half 32 bits.
• These 32 bits from right half are to be XORed with left half to get Final
32 bit right half of 64 bit cipher text.
Process 2 : 48 bit key scheduling
Steps :
1) 64 bit key is reduced to 56 bits by removing every 8th
single bit called as parity bit. This is permuted choice 1.
2) These 56 bits are left circular shifted and result is
again 56 bits.
3) This left circular shift process shifts 1 bit for round nos.
1,2,9 and 16. For other rounds it shifts 2 bits in left
circular way. Same 56 bits will be left shifted for all 16
rounds.
4) These 56 bits are then reduced to 48 bits by again
removing 8 bits which is permuted choice 2.
5)As a result what we get is the 48 bit key for each
round.
The keys are identified as k1,k2,k3,….k16
Decryption (DES)
• Decryption is extracting original plain
text from cipher text.
• In this process, cipher text of 64 bits is
the input.
• Same steps have to be followed as
initial permutation, 16 rounds, 32 bit
swap, and inverse initial permutation.
• The point to be noted here is though the
procedure is same as encryption, the
keys change. For first round the key is
k16, then k15 and so on.
• Next two steps are same as earlier, to
finally get the 64 bit plain text.
Thank you

You might also like