Scribd
Upload
11 views3 pages

CN Des

CN DES algorithm theroy

Uploaded by

Xyz
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
11 views3 pages

CN Des

CN DES algorithm theroy

Uploaded by

Xyz
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/ 3

Data encryption standard (DES)

Data encryption standard (DES) is a block cipher and encrypts data in blocks
of size of 64 bits each, which means 64 bits of plain text goes as the input to
DES, which produces 64 bits of ciphertext. The key length is 56 bits.

We have mentioned that DES uses a 56-bit key. Actually, the initial key consists
of 64 bits. However, before the DES process even starts, every 8th bit of the
key is discarded to produce a 56-bit key. That is bit positions 8, 16, 24, 32, 40,
48, 56, and 64 are discarded.

Thus, the discarding of every 8th bit of the key produces a 56-bit key from the
original 64-bit key.
DES is based on the two fundamental attributes of cryptography: substitution
(also called confusion) and transposition (also called diffusion). DES consists of
16 steps, each of which is called a round. Each round performs the steps of
substitution and transposition. Let us now discuss the broad-level steps in
DES.
1. In the first step, the 64-bit plain text block is handed over to an initial
Permutation (IP) function.
2. The initial permutation is performed on plain text.
3. Next, the initial permutation (IP) produces two halves of the permuted block;
says Left Plain Text (LPT) and Right Plain Text (RPT).
4. Now each LPT and RPT go through 16 rounds of the encryption process.
5. In the end, LPT and RPT are rejoined and a Final Permutation (FP) is
performed on the combined block
6. The result of this process produces 64-bit ciphertext.
Initial Permutation (IP) –
As we have noted, the initial permutation (IP) happens only once and it
happens before the first round. It suggests how the transposition in IP should
proceed.

Step-1: Key transformation –


We have noted initial 64-bit key is transformed into a 56-bit key by discarding
every 8th bit of the initial key. Thus, for each a 56-bit key is available. From this
56-bit key, a different 48-bit Sub Key is generated during each round using a
process called key transformation. For this, the 56-bit key is divided into two
halves, each of 28 bits. These halves are circularly shifted left by one or two
positions, depending on the round.

For example, if the round numbers 1, 2, 9, or 16 the shift is done by only


position for other rounds, the circular shift is done by two positions. The number
of key bits shifted per round is shown in the figure.
Step-2: Expansion Permutation –
Recall that after initial permutation, we had two 32-bit plain text areas called
Left Plain Text(LPT) and Right Plain Text(RPT). During the expansion
permutation, the RPT is expanded from 32 bits to 48 bits. Bits are permuted as
well hence called expansion permutation. This happens as the 32-bit RPT is
divided into 8 blocks, with each block consisting of 4 bits. Then, each 4-bit block
of the previous step is then expanded to a corresponding 6-bit block, i.e., per 4-
bit block, 2 more bits are added.

You might also like