Scribd
Upload
52 views17 pages

Data Encryption Standard (Des)

The document describes the Data Encryption Standard (DES) algorithm. DES uses a 64-bit plaintext input which undergoes an initial permutation and is then divided into 32-bit halves before being encrypted over 16 rounds using subkeys generated from a 64-bit key. Each round includes expansion, substitution, and permutation functions. Decryption follows the same process in reverse order using the subkeys in reverse order. The algorithm aims to be secure but critics argue the 56-bit key is too short against brute force attacks.

Uploaded by

DuttaUdayaVenkataChegondi
Copyright
© © All Rights Reserved
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
52 views17 pages

Data Encryption Standard (Des)

The document describes the Data Encryption Standard (DES) algorithm. DES uses a 64-bit plaintext input which undergoes an initial permutation and is then divided into 32-bit halves before being encrypted over 16 rounds using subkeys generated from a 64-bit key. Each round includes expansion, substitution, and permutation functions. Decryption follows the same process in reverse order using the subkeys in reverse order. The algorithm aims to be secure but critics argue the 56-bit key is too short against brute force attacks.

Uploaded by

DuttaUdayaVenkataChegondi
Copyright
© © All Rights Reserved
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/ 17

DATA ENCRYPTION

STANDARD (DES)
Encryption

[1
]
Encryption (cont.)
64-bit plaintext (X)

Initial Permutation (IP)

64-bit key (K)


Key i
Round (i) Key Generation (KeyGen)

32-bit Switch (SW)

Inversion of Initial Permutation (IP-1)

64-bit ciphertext (Y)


Encryption (cont.)
 Plaintext: X
 Initial Permutation: IP( )
 Round : 1≤ i ≤ 16
i
 32-bit switch: SW( )
 Inverse IP: IP-1( )
 Ciphertext: Y
1

 Y  IP ( SW ( Round i ( IP ( X ), Key i )))


Encryption (IP, IP-1)
 IP  IP-1
Bit 0 1 2 3 4 5 6 7 Bit 0 1 2 3 4 5 6 7
1 58 50 42 34 26 18 10 2 1 40 8 48 16 56 24 64 32
9 60 52 44 36 28 20 12 4 9 39 7 47 15 55 23 63 31
17 62 54 46 38 30 22 14 6 17 38 6 46 14 54 22 62 30
25 64 56 48 40 32 24 16 8 25 37 5 45 13 53 21 61 29
33 57 49 41 33 25 17 9 1 33 36 4 44 12 52 20 60 28
41 59 51 43 35 27 19 11 3 41 35 3 43 11 51 19 59 27
49 61 53 45 37 29 21 13 5 49 34 2 42 10 50 18 58 26
57 63 55 47 39 31 23 15 7 57 33 1 41 9 49 17 57 25

 Note: IP(IP-1) = IP-1(IP) = I


Encryption (Round)
(Key
Generation)

[1
]
Encryption (Round) (cont.)
Li-1 Ri-1

Expansion/permutation (E_table)

XOR Ki

F Substitution/choice (S-box)

Permutation (P)

XOR

Li Ri
Encryption (Round) (cont.)
F

S-box

[1
]
Encryption (Round) (cont.)
 Separate plaintext as L0R0
 L0: left half 32 bits of plaintext
 R0: right half 32 bits of plaintext
 Expansion/permutation: E( )
 Substitution/choice: S-box( )
 Permutation: P( )

F
 Ri  Li 1 ~ P ( S _ box ( E ( Ri 1 ) ~ Keyi ))
Li  Ri 1
Encryption (Round) (cont.)
 E  P
32 1 2 3 4 5 16 7 20 21 29 12 28 17
4 5 6 7 8 9
1 15 23 26 5 18 31 10
8 9 10 11 12 13
2 8 24 14 32 27 3 9
12 13 14 45 16 17
16 17 18 19 20 21 9 13 30 6 22 11 4 25
20 21 22 23 24 25
24 25 26 27 28 29
28 29 30 31 32 1

Expansion Expansion
Encryption (Round) (cont.)
 S-box

[1
]
Key Generation
(Encryption)

[1
]
Key Generation (cont.)
Input Key

Permuted Choice One (PC-1)

C0 D0
▪ ▪
▪ ▪
▪ ▪
Ci-1 Di-1
Permuted Choice Two (PC-
2)
Schedule of Left Shifts
Keyi
Ci Di
Key Generation (cont.)
 Original Key: Key0
 Permuted Choice One: PC_1( )
 Permuted Choice Two: PC_2( )
 Schedule of Left Shift: SLS( )
 ( C0 , D0 )  PC _ 1( Key 0 )

( Ci , Di )  SLS ( Ci 1 , Di 1 )

Keyi  PC _ 2( SLS (Ci 1 , Di 1 ))
Decryption
 The same algorithm as
encryption.
 Reversed the order of key
(Key16, Key15, … Key1).
 For example:
 IP undoes IP-1 step of
encryption.
 1st round with SK16
undoes 16th encrypt round.

[1
]
Strength of DES
 Criticism
 Reduction in key size of 72 bits
 Too short to withstand with brute-force attack
 S-boxes were classified.
 Weak points enable NSA to decipher without key.
 56-bit keys have 256 = 7.2 x 1016 values
 Brute force search looks hard.
 A machine performing one DES encryption per
microsecond would take more than a thousand year to
break the cipher.
Strength of DES (cont.)
 Avalanche effect in
DES
 Ifa small change in
either the plaintext or
the key, the ciphertext
should change
markedly.
 DES exhibits a strong
avalanche effect.

You might also like