Scribd
Upload
67 views6 pages

Data Encryption Standard (DES)

The document summarizes several encryption algorithms: 1) Data Encryption Standard (DES) was published in 1977 and uses a 64-bit block size and 56-bit key. It operates through 16 rounds of substitution and permutation. 2) International Data Encryption Algorithm (IDEA) was established in 1991 and uses a 64-bit block size and 128-bit key. It operates through 17 rounds similar to DES but uses different primitive operations like addition and multiplication. 3) Advanced Encryption Standard (AES) was adopted in 2001 and is based on the Rijndael cipher with a fixed 128-bit block size and key sizes of 128, 192, or 256 bits. It operates through a variable

Uploaded by

Faraz Best
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views6 pages

Data Encryption Standard (DES)

The document summarizes several encryption algorithms: 1) Data Encryption Standard (DES) was published in 1977 and uses a 64-bit block size and 56-bit key. It operates through 16 rounds of substitution and permutation. 2) International Data Encryption Algorithm (IDEA) was established in 1991 and uses a 64-bit block size and 128-bit key. It operates through 17 rounds similar to DES but uses different primitive operations like addition and multiplication. 3) Advanced Encryption Standard (AES) was adopted in 2001 and is based on the Rijndael cipher with a fixed 128-bit block size and key sizes of 128, 192, or 256 bits. It operates through a variable

Uploaded by

Faraz Best
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Data Encryption Standard (DES)

Data Encryption Standard (DES)


History, method, application and strength

Published 1977 NBS Original IBM design 64 bit input 64 bit encrypted output 56 bit key with odd parity (total 64 bits) Suitable for hardware not software 56 bits no longer secure

KEY TRANSFORMS IN BLOCK CIPHERS


For a k-bit block cipher - Substitution For every k-bit i/p specify a k-bit o/p k This requires k.2 bits - Permutation For every bit specify new position in block This requires k.log2k bits

Round Structure for Block Encryption


Take 64-bit i/p Break into 8x8-bit blocks Perform substitution and reassemble into 64 bits Perform permutation and repeat After several rounds single i/p bit affects every o/p bit Optimum number of rounds Can be run in reverse for decryption

DES Overview (Encryption)


64 bit input Initial permutation
Gen 16 per round keys

DES Overview (Decryption)


64 bit input Initial permutation
Gen 16 per round keys

56 bit key

56 bit key

Round 1

48 bit key k1

Round 1

48 bit key k16

Round 2 Round 16

48 bit key k2 48 bit key k16

Round 2 Round 16

48 bit key k15 48 bit key k1

Left/right reversal Final permutation (inverse of initial)

Left/right reversal Final permutation (inverse of initial)

DES Overview (decryption)


Encryption run in reverse i.e. Initial permutation Round 1 with k16 Round 2 with k15 Round 16 with k 1 Left/right reversal Final permutation
NB Initial and final permutations are inverses of each other and have no security value Same keys as for Encryption but in Reverse order

The 16 Per Round Keys


28 bits c i-1 Rotate left ci 28 bits di d i-1 Rotate left 28 bits 28 bits

ki k k

24 bits

24 bits

NB Initial permutation to produce c0 and d0 is not random and has no security value

A DES Round (encryption)


64 bit input

A DES Round (decryption)


64 bit output

L n 32 bits

Rn 32 bits Mangler + kn

L n 32 bits

Rn 32 bits Mangler + kn

L n+132 bits 64 bit output

R n+132 bits

L n+132 bits 64 bit input

R n+132 bits

Encrypt/Decrypt in a DES Round


From encryption Ln+1 = R n and Rn+1 = Ln MK (Rn ) n

Mangler Overview
R = 32 bits = 8 x 4 bits 8 x 6 bits by copying last 2 bits in every 4 Take 48 bit key k and add mod 2 to expanded 48 bit R Result is 48 bits = 8 x 6 bits Compress each 6 bits to 4 bits through S box giving 32 bits

Therefore Rn+1 Mk (Rn ) = L n and hence decryption n

Permute 32 bit result NB Importance of permutation to influence next round

NB Mangler function does not require an inverse

International Data Encryption Algorithm (IDEA)

International Data Encryption Algorithm

Established 1991 64-bit plaintext 64-bit ciphertext 128-bit key Round structure and Mangler similar to DES

IDEA Primitive Operations


Two 16-bit numbers one 16 bit number Bitwise exclusive or + + 16 Addition + modulo 2 16 Multiplication x x modulo 2 +1 All operations are reversible

IDEA Overview
64-bit input 128-bit key
key expansion

Xa X b X c Xd
Round 1

K1 K2 K 3 K 4

Round 2

K5 K6 K49K50K 51 K 52

Round 17

64-bit output

IDEA Odd Round


Xa

IDEA Even Round


Xb X
c

Xa

Xb

Xc

Xd

Yin

Z in
Ke

+
kf

Ka

Kb

Kc

Kd

Mangler Function
Yout Zout

+ Xa Xb Xc Xd
Xa

+
Xb

+
Xc

+
Xd

IDEA Decryption
All processes the same Even round is its own inverse (use same keys) Odd rounds use inverse keys

Advanced Encryption Standard

Advanced Encryption Standard


Uses Rijndael system In a pure Rijndael system block and key sizes may be chosen independently(128, 160, 192, 224 and 256 bits) but AES specifies 128-bit block size Number of rounds = 6 + max (block, key size expressed in 32-bit words}

You might also like