Data Encryption Standard

(DES)

Data Encryption Standard (DES)

The most widely used encryption scheme
The algorithm is reffered to the Data Encryption
Algorithm (DEA)
DES is a block cipher
The plaintext is processed in 64-bit blocks
The key is 56-bits in length

How DES works?

64-bit PT
56 bit key

DES

64-bit CT

BLOCK 1
3

DES Round Structure

uses two 32-bit L & R halves
as for any Feistel cipher can describe as:
Li = Ri1
Ri = Li1 xor F(Ri1, Ki)
takes 32-bit R half and 48-bit subkey and:
expands R to 48-bits using permutation E
adds to subkey
passes through 8 S-boxes to get 32-bit result
finally permutes this using 32-bit perm P

DES History
IBM developed Lucifer cipher
by team led by Feistel
used 64-bit data blocks with 128-bit key
then redeveloped as a commercial cipher with
input from NSA and others
in 1973 NBS issued request for proposals for a
national cipher standard
IBM submitted their revised Lucifer which was
eventually accepted as the DES
5

BROAD STEPS OF DES

64-bit PT
INITIAL PERMUTATION (IP)

KEY

LPT

RPT

16 ROUNDS 16 ROUNDS
FINAL PERMUTATION (FP)

64-bit CT
6

BROAD STEPS OF DES

64-bit PT
INITIAL PERMUTATION (IP)

KEY

LPT

RPT

16 ROUNDS 16 ROUNDS
FINAL PERMUTATION (FP)

64-bit CT
7

Initial Permutation (IP) - PT

1

10

11

12

13

14

15

16

58

50

42

34

26

18

10

60

52

44

36

28

20

12

62

54

46

38

30

22

14

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

64

56

48

40

32

24

16

33

34

35

36

37

38

39

40

57

49

41

33

25

17

41

42

43

44

45

46

47

48

59

51

43

35

27

19

11

49

50

51

52

53

54

55

56

61

53

45

37

29

21

13

57

58

59

60

61

62

63

64

63

55

47

39

31

23

15

Initial Permutation (IP) - PT

Even
Numbers

Odd
Numbers

Initial Permutation IP
first step of the data computation
IP reorders the input data bits
even bits to LH half, odd bits to RH half
quite regular in structure (easy in h/w)

10

Each round of DES

L (i-1)

R (i-1)

Ki

+
L (i1)

R (i1)

11

12

Expansion Permutation - RPT

ORIGINAL RPT OF 32 - BITS

BLOCK 1 (4 BITS)

BLOCK 2 (4 BITS)

1
8

2
3

6 BITS

3
4

BLOCK 8 (4 BITS)

4
5

5
4

6
5

7
6

8
7

6 BITS

13

DES Round Structure

8 blocks
8 X 6 bits=
48 bits

14

Selecting entry from S-Box

B1

B2

B3

B4

B5

B6

4-BIT COLUMN NUM

2-BIT ROW NUMBER

15

EXAMPLE OF S-BOX
0000 0001 0010 0100 0101 0110

0111

1000

00 1110

0100 1101 0001 0010 1111

1011

1001

01 0000

1111

0111 0100 1110 0010

1101

0001

10 0100 0001

1110 1000 1101 1101

1100

0111

1100 1000 0001 1000 0011

1110

0101

11 1110

000011 = 1111
Substitution of from 6-bit to 4 bit conversion
16

Substitution Boxes S
have eight S-boxes which map 6 to 4 bits
each S-box is actually 4 little 4 bit boxes
outer bits 1 & 6 (row bits) select one rows
inner bits 2-5 (col bits) are substituted
result is 8 lots of 4 bits, or 32 bits
row selection depends on both data & key
feature known as autoclaving (autokeying)

17

18

19