Data Encryption Standard

(DES)

6.1
 Chapter 6
Objectives

❏ To review a short history of DES

❏ To define the basic structure of DES

❏ To describe the details of building elements of DES

❏ To describe the round keys generation process

❏ To analyze DES

6.2
 6-1 INTRODUCTION

The Data Encryption Standard (DES) is a symmetric

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

Topics discussed in this section:

6.1.1 History
6.1.2 Overview

6.3
 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.4
 6.1.2 Overview

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

Figure 6.1 Encryption and decryption with DES

6.5
 6-2 DES STRUCTURE

The encryption process is made of two permutations

(P--boxes), which we call initial and final
(P
permutations, and sixteen Feistel rounds
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.4 Examples
6.6
 6-2 Continue

Figure 6.2 General structure of DES

6.7
 6.2.1 Initial and Final Permutations

Figure 6.3 Initial and final permutation steps in DES

6.8
 6.2.1 Continue

Table 6.1 Initial and final permutation tables

6.9
 6.2.1 Continued

Example 6.1

Find the output of the initial permutation box when the input
is given in hexadecimal as
as::

Solution
Only bit 25 and bit 64 are 1s; the other bits are 0s. In the final
permutation, bit 25 becomes bit 64 and bit 63 becomes bit 15 15..
The result is

6.10
 6.2.1 Continued

Example 6.2
Prove that the initial and final permutations are the inverse
of each other by finding the output of the final permutation if
the input is

Solution
The input has only two 1s; the output must also have only two
1s. Using Table 6.1, we can find the output related to these
two bits
bits.. Bit 15 in the input becomes bit 63 in the output
output.. Bit
64 in the input becomes bit 25 in the output
output.. So the output
has only two 1s, bit 25 and bit 63
63.. The result in hexadecimal is

6.11
 6.2.1 Continued

Note

The initial and final permutations are

straight P-boxes that are inverses
of each other.
They have no cryptography significance in
DES.

6.12
 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.13
 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.14
 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.15
 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.16
 6.2.2 Continue

XOR Operation
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.17
 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.18
 6.2.2 Continue

Figure 6.8 S-box rule

6.19
 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.20
 6.2.2 Continued
Example 6.3

The input to S-box 1 is 10001

000111. 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
decimal.. The remaining bits are 0001 in
binary, which is 1 in decimal
decimal.. We look for the value in row 3,
column 1, in Table 6.3 (S
(S--box 1). The result is 12 in decimal,
which in binary is 1100
1100.. So the input 100011 yields the output
1100..
1100

6.21
 6.2.2 Continued
Example 6.4

The input to S-box 8 is 000000

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
decimal.. The remaining bits are 0000 in
binary, which is 0 in decimal
decimal.. We look for the value in row 0,
column 0, in Table 6.10 (S(S--box 8). The result is 13 in decimal,
which is 1101 in binary
binary.. So the input 000000 yields the output
1101..
1101

6.22
 6.2.2 Continue

Straight Permutation

Table 6.11 Straight permutation table

6.23
 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.24
 6.2.3 Continued
Figure 6.9 DES cipher and reverse cipher for the first approach

6.25
 6.2.3 Continued

Algorithm 6.1 Pseudocode for DES cipher

6.26
 6.2.3 Continued

Algorithm 6.1 Pseudocode for DES cipher (Continued)

6.27
 6.2.3 Continued

Algorithm 6.1 Pseudocode for DES cipher (Continued)

6.28
 6.2.3 Continued

Algorithm 6.1 Pseudocode for DES cipher (Continued)

6.29
 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.30
 6.2.3 Continued

Figure 6.10
Key generation

6.31
 6.2.3 Continued

Table 6.12 Parity-bit drop table

Table 6.13 Number of bits shifts

6.32
 6.2.3 Continued

Table 6.14 Key-compression table

6.33
 6.2.3 Continued

Algorithm 6.2 Algorithm for round-key generation

6.34
 6.2.3 Continued

Algorithm 6.2 Algorithm for round-key generation (Continue)

6.35
 6.2.4 Examples
Example 6.5
We choose a random plaintext block and a random key, and
determine what the ciphertext block would be (all in
hexadecimal)::
hexadecimal)

Table 6.15 Trace of data for Example 6.5

6.36
 6.2.4 Continued
Example 6.5 Continued

Table 6.15 Trace of data for Example 6.5 (Conintued

6.37
 6.2.4 Continued
Example 6.6
Let us see how Bob, at the destination, can decipher the
ciphertext received from Alice using the same key
key.. Table 6.16
shows some interesting points
points..

6.38
DES Round Structure
 6-3 DES ANALYSIS

Critics have used a strong magnifier to analyze DES

DES..
Tests have been done to measure the strength of some
desired properties in a block cipher
cipher..

Topics discussed in this section:

6.3.1 Properties
6.3.2 Design Criteria
6.3.3 DES Weaknesses

6.40
 6.3.1 Properties

Two desired properties of a block cipher are the

avalanche effect and the completeness.

Example 6.7
To check the avalanche effect in DES, let us encrypt two
plaintext blocks (with the same key) that differ only in one bit
and observe the differences in the number of bits in each
round..
round

6.41
 6.3.1 Continued
Example 6.7 Continued

Although the two plaintext blocks differ only in the rightmost

bit, the ciphertext blocks differ in 29 bits
bits.. This means that
changing approximately 1.5 percent of the plaintext creates a
change of approximately 45 percent in the ciphertext
ciphertext..

Table 6.17 Number of bit differences for Example 6.7

6.42
 6.3.1 Continued

Completeness effect
Completeness effect means that each bit of the ciphertext
needs to depend on many bits on the plaintext.

6.43
 6.3.2 Design Criteria

S-Boxe
The design provides confusion of bits from each round to
the next.
P-Boxes
They provide diffusion of bits.

Number of Rounds
DES uses sixteen rounds of Feistel ciphers. the ciphertext
is thoroughly a random function of plaintext and
ciphertext.

6.44
 6.3.3 DES Weaknesses

During the last few years critics have found some

weaknesses in DES.
Weaknesses in Cipher Design
1. Weaknesses in S-boxes
2. Weaknesses in P-boxes
3. Weaknesses in Key

6.45
 6.3.3 Continued
Example 6.8
Let us try the first weak key in Table 6.18 to encrypt a block
two times
times.. After two encryptions
with the same key the original plaintext block is created
created.. Note
that we have used the encryption algorithm two times, not
one encryption followed by another decryption
decryption..

6.46
 6.3.3 Continued

Figure 6.11 Double encryption and decryption with a weak key

6.47
 6.3.3 Continued

6.48
 6.3.3 Continued

6.49
 6.3.3 Continued

Figure 6.12 A pair of semi-weak keys in encryption and decryption

6.50
 6.3.3 Continued
Example 6.9

What is the probability of randomly selecting a weak, a semi

semi--
weak, or a possible weak key?
Solution

DES has a key domain of 256. The total number of the above
keys are 64 (4 + 12 + 4848)). The probability of choosing one of
these keys is 8.8 × 10−16, almost impossible
impossible..

6.51
 6.3.3 Continued

6.52
 6.3.3 Continued
Example 6.10

Let us test the claim about the complement keyskeys.. We have

used an arbitrary key and plaintext to find the corresponding
ciphertext.. If we have the key complement and the plaintext,
ciphertext
we can obtain the complement of the previous ciphertext
(Table 6.20
20)).

6.53
 6-4 Multiple DES

The major criticism of DES regards its key length

length..
Fortunately DES is not a group
group.. This means that we
can use double or triple DES to increase the key size
size..

Topics discussed in this section:

6.4.1 Double DES
6.4.4 Triple DES

6.54
 6-4 Continued
A substitution that maps every possible input to every
possible output is a group
group..
Figure 6.13 Composition of mapping

6.55
 6.4.1 Double DES

The first approach is to use double DES (2DES).

Meet-in-the-Middle Attack
However, using a known-plaintext attack called meet-in-
the-middle attack proves that double DES improves this
vulnerability slightly (to 257 tests), but not tremendously
(to 2112).

6.56
 6.4.1 Continued
Figure 6.14 Meet-in-the-middle attack for double DES

6.57
 6.4.1 Continued

Figure 6.15 Tables for meet-in-the-middle attack

6.58
 6.4.2 Triple DES
Figure 6.16 Triple DES with two keys

6.59
 6.4.2 Continuous

Triple DES with Three Keys

The possibility of known-plaintext attacks on triple DES
with two keys has enticed some applications to use triple
DES with three keys. Triple DES with three keys is used
by many applications such as PGP (See Chapter 16).

6.60
 6-5 Security of DES

DES, as the first important block cipher, has gone

through much scrutiny
scrutiny.. Among the attempted attacks,
three are of interest
interest:: brute
brute--force, differential
cryptanalysis, and linear cryptanalysis
cryptanalysis..

Topics discussed in this section:

6.5.1 Brute-Force Attack
6.5.2 Differential Cryptanalysis
6.5.3 Linear Cryptanalysis

6.61
 6.5.1 Brute-Force Attack

We have discussed the weakness of short cipher key in

DES. Combining this weakness with the key complement
weakness, it is clear that DES can be broken using 255
encryptions.

6.62
 6.5.2 Differential Cryptanalysis

It has been revealed that the designers of DES already

knew about this type of attack and designed S-boxes and
chose 16 as the number of rounds to make DES
specifically resistant to this type of attack.

6.63
Differential Cryptanalysis

 a statistical attack against Feistel ciphers

 design of S-P networks has output of function f
influenced by both input & key
 hence cannot trace values back through cipher
without knowing values of the key
 The scheme can successfully cryptanalyze DES
with an effort on the order 247 chosen plaintexts
 Differential Cryptanalysis Compares Pairs of
Encryptions

 with a known difference in the input

 searching for a known difference in output
 when same subkeys are used
Differential Cryptanalysis

 have some input difference giving some output

difference with probability p
 if find instances of some higher probability input /
output difference pairs occurring
 can infer subkey that was used in round
 then must iterate process over many rounds (with
decreasing probabilities)
Differential Cryptanalysis
 perform attack by repeatedly encrypting plaintext pairs
with known input XOR until obtain desired output XOR
 when found
 if intermediate rounds match required XOR have a right
pair
 if not then have a wrong pair, relative ratio is S/N for
attack
 can then deduce keys values for the rounds
 right pairs suggest same key bits
 wrong pairs give random values
 for large numbers of rounds, probability is so low that
more pairs are required than exist with 64-bit inputs
 Biham and Shamir have shown how a 13-round iterated
characteristic can break the full 16-round DES
 6.5.3 Linear Cryptanalysis
Linear cryptanalysis is newer than differential
cryptanalysis. DES is more vulnerable to linear
cryptanalysis than to differential cryptanalysis. S-boxes
are not very resistant to linear cryptanalysis. It has been
shown that DES can be broken using 243 pairs of known
plaintexts. However, from the practical point of view,
finding so many pairs is very unlikely.

6.68
Linear Cryptanalysis

 find linear approximations with prob p != ½

 P[i1,i2,...,ia] XOR C[j1,j2,...,jb] = K[k1,k2,...,kc]
 where ia,jb,kc are bit locations in P,C,K
 gives linear equation for key bits
 get one key bit using max likelihood algo.
 using a large number of trial encryptions
 effectiveness given by: |p–½|