0% found this document useful (0 votes)
41 views23 pages

Data Encryption Standard (DES)

The Data Encryption Standard (DES) is a symmetric-key block cipher published by the National Institute of Standards and Technology (NIST) in the 1970s. DES uses a 56-bit key to encrypt 64-bit blocks of data through 16 rounds of encryption using permutations, substitutions via lookup tables, and XOR operations with 48-bit round keys generated from the original key. The encryption process involves an initial and final permutation of the plaintext blocks and subkey generation before and after the 16 rounds of processing.

Uploaded by

geniusguy89
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views23 pages

Data Encryption Standard (DES)

The Data Encryption Standard (DES) is a symmetric-key block cipher published by the National Institute of Standards and Technology (NIST) in the 1970s. DES uses a 56-bit key to encrypt 64-bit blocks of data through 16 rounds of encryption using permutations, substitutions via lookup tables, and XOR operations with 48-bit round keys generated from the original key. The encryption process involves an initial and final permutation of the plaintext blocks and subkey generation before and after the 16 rounds of processing.

Uploaded by

geniusguy89
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 23

Data Encryption Standard

(DES)
6-1 INTRODUCTION

The Data Encryption Standard (DES) is a symmetric-


key block cipher published by the National Institute of
Standards and Technology (NIST).

Topics discussed in this section:


6.1.1 History
6.1.2 Overview
6.1.1 History

In 1973, NIST published a request for proposals for a


national symmetric-key cryptosystem. A proposal from
IBM, a modification of a project called Lucifer, was
accepted as DES. DES was published in the Federal
Register in March 1975 as a draft of the Federal
Information Processing Standard (FIPS).
6.1.2 Overview

DES is a block cipher, as shown in Figure 6.1.

Figure 6.1 Encryption and decryption with DES


6-2 DES STRUCTURE

The encryption process is made of two permutations


(P-boxes), which we call initial and final
permutations, and sixteen Feistel rounds.

Topics discussed in this section:

6.2.1 Initial and Final Permutations


6.2.2 Rounds
6.2.3 Cipher and Reverse Cipher
6-2 Continue

Figure 6.2 General structure of DES


6.2.1 Initial and Final Permutations

Figure 6.3 Initial and final permutation steps in DES


6.2.1 Continue

Table 6.1 Initial and final permutation tables


6.2.2 Rounds

DES uses 16 rounds. Each round of DES is a Feistel


cipher.

Figure 6.4
A round in DES
(encryption site)
6.2.2 Continued
DES Function
The heart of DES is the DES function. The DES function
applies a 48-bit key to the rightmost 32 bits to produce a
32-bit output.

Figure 6.5
DES function
6.2.2 Continue

Expansion P-box
Since RI−1 is a 32-bit input and KI is a 48-bit key, we first
need to expand RI−1 to 48 bits.

Figure 6.6 Expansion permutation


6.2.2 Continue

Although the relationship between the input and output


can be defined mathematically, DES uses Table 6.2 to
define this P-box.
Table 6.6 Expansion P-box table
6.2.2 Continue

Whitener (XOR)
After the expansion permutation, DES uses the XOR
operation on the expanded right section and the round
key. Note that both the right section and the key are 48-
bits in length. Also note that the round key is used only in
this operation.
6.2.2 Continue

S-Boxes
The S-boxes do the real mixing (confusion). DES uses 8
S-boxes, each with a 6-bit input and a 4-bit output. See
Figure 6.7.

Figure 6.7 S-boxes


6.2.2 Continue

Figure 6.8 S-box rule


6.2.2 Continue
Table 6.3 shows the permutation for S-box 1. For the rest
of the boxes see the textbook.

Table 6.3 S-box 1


6.2.2 Continued
Example 6.3

The input to S-box 1 is 100011. What is the output?

Solution
If we write the first and the sixth bits together, we get 11 in
binary, which is 3 in decimal. The remaining bits are 0001 in
binary, which is 1 in decimal. We look for the value in row 3,
column 1, in Table 6.3 (S-box 1). The result is 12 in decimal,
which in binary is 1100. So the input 100011 yields the output
1100.
6.2.2 Continued
Example 6.4

The input to S-box 8 is 000000. What is the output?

Solution
If we write the first and the sixth bits together, we get 00 in
binary, which is 0 in decimal. The remaining bits are 0000 in
binary, which is 0 in decimal. We look for the value in row 0,
column 0, in Table 6.10 (S-box 8). The result is 13 in decimal,
which is 1101 in binary. So the input 000000 yields the output
1101.
6.2.3 Cipher and Reverse Cipher

Using mixers and swappers, we can create the cipher and


reverse cipher, each having 16 rounds.

First Approach
To achieve this goal, one approach is to make the last
round (round 16) different from the others; it has only a
mixer and no swapper.

Note

In the first approach, there is no swapper in


the last round.
6.2.3 Continued
Figure 6.9 DES cipher and reverse cipher for the first approach
6.2.3 Continued

Alternative Approach
We can make all 16 rounds the same by including one
swapper to the 16th round and add an extra swapper after
that (two swappers cancel the effect of each other).

Key Generation
The round-key generator creates sixteen 48-bit keys out
of a 56-bit cipher key.
6.2.3 Continued

Figure 6.10
Key generation
6.2.3 Continued

Table 6.12 Parity-bit drop table

Table 6.13 Number of bits shifts

You might also like