Data Encryption Standard

( DES)

Presented by-
Md. Mahbur Rahman
Lecturer
Dept. of Computer Science and Engineering
Bangladesh Army University of Science & Technology
Data Encryption Standard( DES)
• The DES was once a predominant symmetric key algorithm for the encryption data.
• It was highly influential in the advancement of modern cryptography in the academic
world.
• Issued in 1977 by the National Bureau of Standards as Federal Information Processing
• Algorithm itself is referred to as the Data Encryption Algorithm (DEA)
• There are two inputs to the encryption function. The plaintext to be encrypted and the
key.
• Data are encrypted in 64-bit blocks using a 56-bit key
• The algorithm transforms 64-bit input in a series of steps into a 64-bit output
• The same steps, with the same key, are used to reverse the encryption
DES Encryption Algorithm
1. The right hand side of the figure, the plaintext proceeds in three
phases.
2. First, 64 bit plaintext passes through an initial permutation(IP)
that rearranges the bit produce the permuted input.
3. The phase consisting of sixteen rounds of the same function,
which involves both permutation and substitution functions.
4. The output of the last round consists of 64 bits that are a
function of input plaintext and a key.
5. The left & right halves of the output are swapped to produce
the pre-output.
6. Finally, the pre-output is passed through permutation [IP-1]
that is inverse of the initial permutation function, to produce
the 64 bit ciphertext.
7. The right hand side portion, in which the 56 bit key is used.
Initially the key is passed through a permutation function.
8. Then for each 16 rounds, a subkey(Ki) is produced a
combination of a left circular shift and a permutation.
9. This is same for each round. But different subkey is produced
because the repeated shift of the key bits
Details of Single Round
• Figure shows the internal structure of a single
round.
• Again, begin by focusing on the left-hand side of
the diagram. The left and right halves of each 64-
bit intermediate value are treated as separate 32-bit
quantities, labeled L (left) and R (right).
• As in any classic Feistel cipher, the overall
processing at each round can be summarized in the
following formulas:
Li = Ri-1
Ri = Li-1 x F(Ri-1, Ki)
• The round key Ki is 48 bits. The R input is 32 bits.
This R input is first expanded to 48 bits by using a
table that defines a permutation plus an expansion
that involves duplication of 16 of the R bits.
• The resulting 48 bits are XORed with Ki. This 48-
bit result passes through a substitution function that
produces a 32-bit output
Role of the S-boxes
• The role of the S-boxes in the function F is illustrated
in Figure.
• The substitution consists of a set of eight S-boxes, each
of which accepts 6 bits as input and produces 4 bits as
output. These transformations are defined in the next
page, which is interpreted as follows:
• The first and last bits of the input to box Si form a 2-bit
binary number to select one of four substitutions
defined by the four rows in the table for Si.
• The middle four bits select one of the sixteen columns.
• The decimal value in the cell selected by the row and
column is then converted to its 4-bit representation to
produce the output.
• For example, in S1 for input 011001, the row is 01 (row
1) and the column is 1100 (column 12). The value in
row 1, column 12 is 9, so the output is 1001.
Table . Definition of DES S-Boxes
Avalanche Effect
• A desirable property of any encryption algorithm is that a small
change in either the plaintext or the key should produce a
significant change in the ciphertext. This is known as avalanche
effect.

• DES exhibits a strong avalanche effect. Table a and b shows some

00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000

10000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000

with the key

0000001 1001011 0100100 1100010 0011100 0011000 0011100 0110010

• The Table a shows that after just three rounds, 21 bits differ between
the two blocks. On completion, the two ciphertexts differ in 34 bit
positions.
Thank You
References
• https://flylib.com/books/en/3.190.1.39/1/
• https://www.slideshare.net/MFLORENCEDAYANA/block-ciphers-
and-the-data-encryption-standard