The document describes the Data Encryption Standard (DES) algorithm. It is a block cipher that encrypts data in 64-bit blocks using a 56-bit key. The key is processed through permutations to generate 16 48-bit subkeys that are used in the cipher's core Feistel function. The Feistel function performs expansion, key mixing with an XOR, substitution using 8 S-boxes, and permutation on half the data block before swapping and repeating over multiple rounds.
The document describes the Data Encryption Standard (DES) algorithm. It is a block cipher that encrypts data in 64-bit blocks using a 56-bit key. The key is processed through permutations to generate 16 48-bit subkeys that are used in the cipher's core Feistel function. The Feistel function performs expansion, key mixing with an XOR, substitution using 8 S-boxes, and permutation on half the data block before swapping and repeating over multiple rounds.
The document describes the Data Encryption Standard (DES) algorithm. It is a block cipher that encrypts data in 64-bit blocks using a 56-bit key. The key is processed through permutations to generate 16 48-bit subkeys that are used in the cipher's core Feistel function. The Feistel function performs expansion, key mixing with an XOR, substitution using 8 S-boxes, and permutation on half the data block before swapping and repeating over multiple rounds.
The document describes the Data Encryption Standard (DES) algorithm. It is a block cipher that encrypts data in 64-bit blocks using a 56-bit key. The key is processed through permutations to generate 16 48-bit subkeys that are used in the cipher's core Feistel function. The Feistel function performs expansion, key mixing with an XOR, substitution using 8 S-boxes, and permutation on half the data block before swapping and repeating over multiple rounds.
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
You are on page 1/ 29
DES Algorithm
Data Encryption Standard
DES Features Block cipher, 64 bits per block 64-bit key, with only 56 bits effective ECB mode and CBC mode DES Key Scheduling Specify a 64-bit key There are eight parity bits The key structure is in the next page Bit 0 Bit 1 Bit 2 Bit 3 Bit 4 Bit 5 Bit 6 Bit 7 Bit Effective Key Parity Bit 0~7 Bit Effective Key Parity Bit 8~15 Bit Effective Key Parity Bit 16~23 Bit Effective Key Parity Bit 24~31 Bit Effective Key Parity Bit 32~39 Bit Effective Key Parity Bit 40~47 Bit Effective Key Parity Bit 48~55 Bit Effective Key Parity Bit 56~63 DES Key Scheduling Key permutation according to Permuted Choice 1(PC-1) After permutation, the key length will be only 56 bits 64 bits 56 bits? Why? The explanation is in the next page Permuted Choice 1 Bit 0 1 2 3 4 5 6
1 57 49 41 33 25 17 9
8 1 58 50 42 34 26 18
15 10 2 59 51 43 35 27
22 19 11 3 60 52 44 36
29 63 55 47 39 31 23 15
36 7 62 54 46 38 30 22
43 14 6 61 53 45 37 29
50 21 13 5 28 20 12 4
Note: The 8n-th bit is disappeared!!
DES Key Scheduling We separate the 56-bit key to two 28-bit keys: Lk and Rk Left rotate the Lk and Rk according to SRT (Subkey Rotation Table) After rotation, merge Lk and Rk Permutation according to Permuted Choice 2 (PC-2) We get a 48-bit subkey now DES Key Scheduling Repeat the operation 16 times to get 16 subkeys Use rotated Lk and Rk Why each subkey has length of only 48 bits instead of 56 bits? The answer is similar to PC-1 Subkey Rotation Table Round 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Number Bits to 1 1 2 2 2 2 2 2 1 2 2 2 2 2 2 1 Rotate
DES Core Function L[0] to L[15], R[0] to R[15] Feistel (F) function Inverse Initial Permutation Feistel Function Expansion: using E-bit Selection Table Key Mixing: XOR with subkeys Substitution: S-box Permutation: P-box Feistel Function - Expansion E-Bit Selection Table Copy R[0] to a buffer Rb Bit 0 1 2 3 4 5
Rb: 32 bits 48 1 32 1 2 3 4 5 7 4 5 6 7 8 9 bits 13 8 9 10 11 12 13 19 12 13 14 15 16 17 25 16 17 18 19 20 21 31 20 21 22 23 24 25 37 24 25 26 27 28 29 43 28 29 30 31 32 1 Feistel Function Key Mixing After the expansion operation, just XOR with subkey K[1] Feistel Function - Substitution 48-bit buffer becomes eight 6-bit blocks 8 S-boxes have output from 0 to 15 which can be represented with 4 bits How do S-boxes work? Wait and see 8 4-bit outputs can be merged, and store it in a 32-bit buffer How do S-boxes Work?
Bit 0 Bit 1 Bit 2 Bit 3 Bit 4 Bit 5
Row Column
Use the Row and Column number to find the corresponding output number from the S-box. Besides, the n-th block must use the n-th S-box. S-Box 1: Substitution Box 1 Row / Column 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 14 4 13 1 2 15 11 8 3 10 6 12 5 9 0 7 1 0 15 7 4 14 2 13 1 10 6 12 11 9 5 3 8 2 4 1 14 8 13 6 2 11 15 12 9 7 3 10 5 0 3 15 12 8 2 4 9 1 7 5 11 3 14 10 0 6 13
Row / Column 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 13 2 8 4 6 15 11 1 10 9 3 14 5 0 12 7 1 1 15 13 8 10 3 7 4 12 5 6 11 0 14 9 2 2 7 11 4 1 9 12 14 2 0 6 10 13 15 3 5 8 3 2 1 14 7 4 10 8 13 15 12 9 0 3 5 6 11 Feistel Function - Permutation After the substitution, do P Permutation permutation according to Bit 0 1 2 3 the P-box 1 16 7 20 21 5 29 12 28 17 9 1 15 23 26 13 5 18 31 10 17 2 8 24 14 21 32 27 3 9 25 19 13 30 6 29 22 11 4 25 DES Core Function After one round of Feistel Function is completed, the buffer is XORed with L, becoming the next R Previous R becomes the next L Repeat the operations mentioned above 16 times DES Core Function When 16 rounds are finished, L and R are swapped and merged, then becomes a 64-bit pre-output Use IP-1 to become the final cipher output DES - Decryption Almost all operations are the same as those of encryption Only one is different: use the subkeys in descending order DES Other Form Triple-DES: quite literally. A Triple-DES key has length of 192 bits. It can be considered three 64-bit DES key. DES40: a key is pre-processed to make it a 40-bit effective key DES - Modes ECB (Electronic Code Book) CBC (Cipher Block Chaining) DES Cryptanalysis
