The document discusses the Data Encryption Standard (DES) algorithm. It describes how DES encrypts data in 64-bit blocks using a 56-bit key. The encryption process involves an initial permutation of the plaintext bits, followed by 16 rounds of substitution and transposition using 48-bit round keys generated from the original key. Finally, the ciphertext is produced after a final permutation.

1. Data Encryption
Standards
•DATA ENCRYPTION STANDARD (DES) HAS BEEN FOUND
VULNERABLE TO VERY POWERFUL ATTACKS AND THEREFORE, THE
POPULARITY OF DES HAS BEEN FOUND SLIGHTLY ON THE DECLINE.
•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 CIPHER TEXT.
•THE SAME ALGORITHM AND KEY ARE USED FOR ENCRYPTION AND
DECRYPTION, WITH MINOR DIFFERENCES.
•THE KEY LENGTH IS 56 BITS

2. The basic idea is shown in the figure.

3.  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

4.  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.
steps in DES:

5. Steps in DES:
 In the first step, the 64-bit plain text block is handed over to an
initial Permutation (IP) function.
 The initial permutation is performed on plain text.
 Next, the initial permutation (IP) produces two halves of the
permuted block; saying Left Plain Text (LPT) and Right Plain Text
(RPT).
 Now each LPT and RPT go through 16 rounds of the encryption
process.
 In the end, LPT and RPT are rejoined and a Final Permutation (FP) is
performed on the combined block
 The result of this process produces 64-bit cipher text.

6.  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.
 If the IP replaces the first bit of the original plain
text block with the 58th bit of the original plain
text, the second bit with the 50th bit of the
original plain text block, and so on.
 This is nothing but jugglery of bit positions of
the original plain text block. the same rule
applies to all the other bit positions

8. Round Function
 The heart of this cipher is the DES function, f. The DES
function applies a 48-bit key to the rightmost 32 bits to
produce a 32-bit output.

9. Expansion Permutation Box − since right input is 32-bit and
round key is a 48-bit, we first need to expand right input
to 48 bits. Permutation logic is graphically depicted in
the following illustration .

10.  The graphically depicted permutation logic is generally described as
table in DES specification illustrated as shown −

11.  XOR (Whitener). − After the expansion permutation, DES does XOR
operation on the expanded right section and the round key. The round key is
used only in this operation.
 Substitution Boxes. − The S-boxes carry out the real mixing (confusion).
DES uses 8 S-boxes, each with a 6-bit input and a 4-bit output. Refer the
following illustration −

12. The S-box rule is illustrated below −

13. There are a total of eight S-box tables. The output of all eight s-boxes is
then combined in to 32 bit section.
Straight Permutation − The 32 bit output of S-boxes is then subjected to the
straight permutation with rule shown in the following illustration:

15. Key Generation
 The round-key generator creates sixteen 48-bit keys out of a 56-bit cipher
key. The process of key generation is depicted in the following illustration −

16. Parity Drop the preprocess before key expansion is a compression transposition step
that we call parity bit drop. It drops the parity bits (bits 8, 16, 24, 32, …, 64) from the
64-bit key and permutes the rest of the bits according to Table 6.12. The remaining 56-
bit value is the actual cipher key which is used to generate round keys. The parity drop
step (a compression D-box) is shown in Table