Computer Security Lecture 4: Block Ciphers and the Data Encryption Standard

Classical Encryption Techniques
Block Ciphers and the Data
Encryption Standard

Stream Ciphers and Block Ciphers
Data Encryption Standard
DES Algorithm
DES Key Creation
DES Encryption
The Strength Of DES

 Stream cipher is one that encrypts a digital data stream one bit or
one byte at a time.
 Block cipher is one in which a block of plaintext is treated as a
whole and used to produce a ciphertext block of equal length.

 Data Encryption Standard is a symmetric-key algorithm for the
encryption of electronic data.
 Developed in the early 1970s at IBM and based on an earlier
design by Horst Feistel.
 DES was issued in 1977 by the National Bureau of Standards, now
the National Institute of Standards and Technology (NIST), as
Federal Information Processing Standard 46

 DES, data are encrypted in 64-bit blocks using a 56 bits (+8 parity
bits) 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 uses "keys" where are also apparently 16 hexadecimal
numbers long, or apparently 64 bits long. However, every 8th key
bit is ignored in the DES algorithm, so that the effective key size is
56 bits.

Initial permutation
Round 1
Round 2
Round 16
32 bit Swap
Inverse initial permutation
64-bit Plain text
64-bit Cipher text
Permuted choice 1
Left Circular Shift
Left Circular Shift
Left Circular Shift
64-bit Key
Permuted choice 2
Permuted choice 2
Permuted choice 2
56 bit
56 bit
56 bit
56 bit
56 bit
56 bit
48 bit
48 bit
48 bit
K1
K2
K16
64 bit
64 bit
64 bit
64 bit
64 bit

Key (56 bits)
Left Right
PC-2
16-Keys (48 bits)
Key (64 bits)
PC-1
Shift (generate 16 keys)
Concatenate

 Let K be the hexadecimal key K = 133457799BBCDFF1
 K (binary) = 00010011 00110100 01010111 01111001
10011011 10111100 11011111 11110001
 K=64bit
 The DES algorithm uses the following steps:

1) Step 1: Apply permutation choice -1 (PC-1)
 The 64-bit key is permuted according to the following table, PC-1

 K = 00010011 00110100 01010111 01111001 10011011
10111100 11011111 11110001
 we get the 56-bit permutation
 Kp = 1111000 0110011 0010101 0101111 0101010 1011001
1001111 0001111

2) Split Kp key into left and right halves
 Kp = 1111000 0110011 0010101 0101111 0101010 1011001
1001111 0001111
 KL = 1111000 0110011 0010101 0101111
 KR = 0101010 1011001 1001111 0001111

2) Apply Shifts (Left) as describe on table
 KL = 1111000 0110011 0010101 0101111
 KR = 0101010 1011001 1001111 0001111
 KL1 =Shift(KL)= 1110000110011001010101011111
 KR1 =Shift(KR)= 1010101011001100111100011110
 KL2 =Shift(KL1)= 1100001100110010101010111111
 KR2 =Shift(KR1)= 0101010110011001111000111101
 KL3 =Shift(KL2)= 0000110011001010101011111111
 KR3 =Shift(KR2)= 0101011001100111100011110101

 KL4 = 0011001100101010101111111100
 KR4 = 0101100110011110001111010101
 KL5 = 1100110010101010111111110000
 KR5 = 0110011001111000111101010101
 KL6 = 001100101010101111111100001
 KR6 = 1001100111100011110101010101
 KL7 = 1100101010101111111100001100
 KR7 = 0110011110001111010101010110

 KL8 = 0010101010111111110000110011
 KR8 = 1001111000111101010101011001
 KL9 = 0101010101111111100001100110
 KR9 = 0011110001111010101010110011
 KL10 = 0101010111111110000110011001
 KR10 = 1111000111101010101011001100
 KL11 = 0101011111111000011001100101
 KR11 = 1100011110101010101100110011

 KL12 = 0101111111100001100110010101
 KR12 = 0001111010101010110011001111
 KL13 = 0111111110000110011001010101
 KR13 = 0111101010101011001100111100
 KL14 = 1111111000011001100101010101
 KR14 = 1110101010101100110011110001
 KL15 = 1111100001100110010101010111
 KR15 = 1010101010110011001111000111

 KL16 = 1111000011001100101010101111
 KR16 = 0101010101100110011110001111

3) Concatenate KL and KR
 K1=1110000 1100110 0101010 1011111 1010101 0110011 0011110 0011110
4) Apply PC-2 to all 16 keys
 we get the 48-bit permutation for each key
 K1=000110 110000 001011 101111 111111 000111 000001 110010

 K1 = 000110 110000 001011 101111 111111 000111 000001 110010
 K2 = 011110 011010 111011 011001 110110 111100 100111 100101
 K3 = 010101 011111 110010 001010 010000 101100 111110 011001
 K4 = 011100 101010 110111 010110 110110 110011 010100 011101
 K5 = 011111 001110 110000 000111 111010 110101 001110 101000
 K6 = 011000 111010 010100 111110 010100 000111 101100 101111
 K7 = 111011 001000 010010 110111 111101 100001 100010 111100
 K8 = 111101 111000 101000 111010 110000 010011 101111 111011
 K9 = 111000 001101 101111 101011 111011 011110 011110 000001
 K10 = 101100 011111 001101 000111 101110 100100 011001 001111

 K11 = 001000 010101 111111 010011 110111 101101 001110 000110
 K12 = 011101 010111 000111 110101 100101 000110 011111 101001
 K13 = 100101 111100 010111 010001 111110 101011 101001 000001
 K14 = 010111 110100 001110 110111 111100 101110 011100 111010
 K15 = 101111 111001 000110 001101 001111 010011 111100 001010
 K16 = 110010 110011 110110 001011 000011 100001 011111 110101

 Assume: M = 0123456789ABCDEF
 M=0000 0001 0010 0011 0100 0101 0110 0111 1000 1001
1010 1011 1100 1101 1110 1111

 M=0000 0001 0010 0011 0100 0101 0110 0111 1000 1001
1010 1011 1100 1101 1110 1111
 Applying the initial permutation to the block of text P (64bit).
 IP=100 1100 0000 0000 1100 1100 1111 1111 1111 0000
1010 1010 1111 0000 1010 1010

 Divide the permuted block IP into a left half L0 of 32 bits, and a right
half R0 of 32 bits.
 L0 = 1100 1100 0000 0000 1100 1100 1111 1111
 R0 = 1111 0000 1010 1010 1111 0000 1010 1010
 Ln = Rn-1
 Rn = Ln-1 ⊕ f (Rn-1,Kn)

 Example: For n = 1, we have
 L0 = 1100 1100 0000 0000 1100 1100 1111 1111
 R0 = 1111 0000 1010 1010 1111 0000 1010 1010
 K1 = 000110 110000 001011 101111 111111 000111 000001
110010
 L1 = R0 = 1111 0000 1010 1010 1111 0000 1010 1010
 R1 = L0 ⊕ f (R0,K1) K=48bit but R0=32bit problem

 Calculate f (R0,K1)

 R1 = L0 ⊕ f (R0,K1)
 E(R0)
 R0 = 1111 0000 1010 1010 1111 0000 1010 1010
 E(R0) = 011110 100001 010101 010101 011110 100001 010101 010101

 R1 = L0 ⊕ f (R0,K1)
 K1 = 000110 110000 001011 101111 111111 000111 000001
110010
 E(R0) = 011110 100001 010101 010101 011110 100001
010101 010101
 K1 ⊕ E(R0) = 011000 010001 011110 111010 100001 100110
010100 100111

 We have not yet finished calculating the function f
 We now have 48 bits, or eight groups of six bits. We now do
something strange with each group of six bits: we use them as
addresses in tables called "S boxes".
 f(Kn , E(Rn-1)) =B1B2B3B4B5B6B7B8
 where each Bi is a group of six bits. We now calculate
 S1(B1) S2(B2) S3(B3) S4(B4) S5(B5) S6(B6) S7(B7) S8(B8)

 The net result is that the eight groups of 6 bits are transformed into
eight groups of 4 bits (the 4-bit outputs from the S boxes) for 32 bits
total.

 For example, for input block B = 011011 the first bit is "0" and the
last bit "1" giving 01 as the row. This is row 1. The middle four bits
are "1101". This is the binary equivalent of decimal 13, so the
column is column number 13. In row 1, column 13 appears 5. This
determines the output; 5 is binary 0101, so that the output is 0101.
Hence S1(011011) = 0101.

 K1 ⊕ E(R0) = 011000 010001 011110 111010 100001 100110
010100 100111.
 S1(B1)S2(B2)S3(B3)S4(B4)S5(B5)S6(B6)S7(B7)S8(B8) = 0101 1100 1000
0010 1011 0101 1001 0111
 The final stage in the calculation of f is to do a permutation P of
the S-box output to obtain the final value of f :
 f = P(S1(B1)S2(B2)...S8(B8))

 S1(B1)S2(B2)S3(B3)S4(B4)S5(B5)S6(B6)S7(B7)S8(B8) = 0101 1100 1000
0010 1011 0101 1001 0111
 f = 0010 0011 0100 1010 1010 1001 1011 1011

 R1 = L0 ⊕ f (R0 , K1 ) =
1100 1100 0000 0000 1100 1100 1111 1111
⊕ 0010 0011 0100 1010 1010 1001 1011 1011
= 1110 1111 0100 1010 0110 0101 0100 0100

 In the next round, we will have L2 = R1, which is the block we just
calculated, and then we must calculate R2 =L1 ⊕ f( R1, K2), and so
on for 16 rounds.
 At the end of the sixteenth round we have the blocks L16 and R16.
We then reverse the order of the two blocks into the 64-bit block

 If we process all 16 blocks using the method defined previously, we get,
on the 16th round
 L16 = 0100 0011 0100 0010 0011 0010 0011 0100
 R16 = 0000 1010 0100 1100 1101 1001 1001 0101
 We reverse the order of these two blocks and apply the final permutation
to
 R16L16 = 00001010 01001100 11011001 10010101 01000011
01000010 00110010 00110100

 Then apply a final permutation IP-1 as defined by the following
table:

 R16L16 = 00001010 01001100 11011001 10010101 01000011
01000010 00110010 00110100
 IP-1 = 10000101 11101000 00010011 01010100 00001111
00001010 10110100 00000101
 which in hexadecimal format is
85E813540F0AB405

This is the encrypted form of M = 0123456789ABCDEF
with K = 133457799BBCDFF1
C = 85E813540F0AB405

 With a key length of 56 bits, there are 256
possible keys
 Brute force search looks hard
 Fast forward to 1998. Under the direction of John Gilmore of the EFF, a
team spent $220,000 and built a machine that can go through the entire
56-bit DES key space in an average of 4.5 days.
 On July 17, 1998, they announced they had cracked a 56-bit key in 56
hours. The computer, called Deep Crack, uses 27 boards each
containing 64 chips, and is capable of testing 90 billion keys a second.

facebook.com/mloey
mohamedloey@gmail.com
twitter.com/mloey
linkedin.com/in/mloey
mloey@fci.bu.edu.eg
mloey.github.io

Computer Security Lecture 4: Block Ciphers and the Data Encryption Standard

More Related Content

What's hot (20)

Viewers also liked (18)

Similar to Computer Security Lecture 4: Block Ciphers and the Data Encryption Standard (20)

More from Mohamed Loey (20)

Recently uploaded (20)

Computer Security Lecture 4: Block Ciphers and the Data Encryption Standard