Data Encryption Standard (DES)

What is DES? (In Simple Words)

The Data Encryption Standard (DES) is one of the most famous Symmetric Block Ciphers in the history of computer security. It was developed by IBM in the early 1970s (based on an earlier cipher called Lucifer by Horst Feistel) and officially adopted by the US Government (NIST) in 1977.

For over 20 years, DES was the global standard used by banks, ATMs, and governments to encrypt financial transactions.

1. Key Facts About DES (Must Memorize for Exams!)

Whenever a question on DES appears in your exam, write these 5 golden numbers in your first paragraph:

DES Algorithm Specifications at a Glance

📦 Block Size: 64 Bits

Takes 64 bits of Plain Text and outputs 64 bits of Cipher Text

🔑 Key Size: 56 Bits

Input key is 64 bits, but 8 bits are parity bits = 56-bit effective key

🔄 Rounds: 16 Rounds

Runs 16 identical Feistel rounds using 16 48-bit subkeys

🧩 S-Boxes: 8 S-Boxes

Each S-Box shrinks 6 bits into 4 bits (48 bits ➔ 32 bits)

Why is the DES Key 56 bits instead of 64 bits?

The user provides a 64-bit key (8 bytes).
However, every 8th bit (bits 8, 16, 24, 32, 40, 48, 56, 64 — total 8 bits) is used only for error checking (parity) and is discarded before encryption begins!
Therefore, the actual secret key length of DES is 64 - 8 = 56 bits.

2. Overall Structure of DES (Step-by-Step Working)

DES is built on a mathematical design called the Feistel Cipher Structure, which mixes Substitution and Transposition (Permutation) 16 times:

Step-by-Step Architecture of DES Encryption

INPUT64-Bit Plain Text Block

Raw 64-bit input block

STEP 1Initial Permutation (IP)

Rearranges the 64 bits and splits into L0 (32-bit) & R0 (32-bit)

STEP 216 Identical Feistel Rounds

Each Round (1 to 16) uses a unique 48-bit Subkey (K1 to K16)

STEP 332-Bit Swap

Left (L16) and Right (R16) halves are swapped after Round 16

STEP 4Final Permutation (IP⁻¹)

Inverse Initial Permutation produces 64-Bit Cipher Text

How a Single Round of DES Works (The Feistel Round):

After the Initial Permutation (IP), the 64-bit block is split into two equal 32-bit halves:

Left Half (Li-1) — 32 bits
Right Half (Ri-1) — 32 bits

In each round i (from Round 1 to Round 16), the new halves are calculated using two formulas:

Formula: Li = Ri-1 Formula: Ri = Li-1 ⊕ F(Ri-1, Ki) (where ⊕ is the bitwise XOR operation, and F is the Mangler / Round Function).

3. Inside the DES Round Function F(R, K)

What happens inside the Round Function F during each of the 16 rounds? It has 4 simple steps:

Expansion Permutation (E-Box) [32 bits → 48 bits]:
Since the Right half (R) is only 32 bits but the round subkey (Ki) is 48 bits, the E-Box expands R from 32 bits to 48 bits by duplicating 16 boundary bits.
Key Mixing (XOR with 48-bit Subkey):
The expanded 48-bit data is XORed (⊕) with the 48-bit round subkey Ki.
Substitution via 8 S-Boxes [48 bits → 32 bits]:
- The 48-bit result is divided into eight 6-bit chunks.
- Each 6-bit chunk enters its own S-Box (S1, S2, …, S8).
- Each S-Box converts a 6-bit input into a 4-bit output (8 × 4 = 32 bits).
- Note: The S-Boxes are the heart of DES security because they provide non-linear confusion!
Permutation (P-Box) [32 bits → 32 bits]:
The 32 bits from the S-Boxes are shuffled one more time by a straight P-Box before being XORed with the Left half (Li-1).

4. How DES Decryption Works

Because DES uses the Feistel Structure, you do NOT need a separate circuit for decryption!

Decryption uses the exact same algorithm and steps as Encryption.
The only difference is that the 16 subkeys are applied in reverse order (K16, K15, …, K1).

5. The Avalanche Effect & Weakness of DES

What is the Avalanche Effect?

A desirable property of any strong encryption algorithm where changing just 1 single bit in the Plain Text (or Key) causes roughly 50% (around 32 bits out of 64) of the Cipher Text bits to flip completely! DES exhibits a strong Avalanche Effect after just a few rounds.

Why did DES become insecure? (56-Bit Key Weakness)

A 56-bit key means there are 2^56 ≈ 7.2 × 10^16 possible keys.
In 1977, that seemed huge. However, by 1998, a special computer called “Deep Crack” broke a DES key in just 56 hours (and later in under 22 hours) using a Brute-Force Attack!

6. Double DES and Triple DES (3DES)

To extend the life of DES without replacing bank hardware, Triple DES (3DES) was introduced:

Double DES (2DES): Encrypts twice with two keys (56 × 2 = 112 bits), but fails due to a clever attack called the Meet-in-the-Middle Attack.
Triple DES (3DES): Applies the DES algorithm three times to each data block (Encrypt → Decrypt → Encrypt, or EDE mode) using 2 or 3 keys, raising the effective key strength to 112 or 168 bits.
Ultimately, both DES and 3DES were replaced by the much faster and stronger AES (Advanced Encryption Standard).

💡 DAVV Exam Preparation Tips

10-Mark Question: “Explain the Data Encryption Standard (DES) algorithm in detail with a neat block diagram.”

Start with the 4 specs:Symmetric Block Cipher, 64-bit block, 56-bit key, 16 Feistel rounds.

Draw the DES Architecture Stack (IP → 16 Rounds → Swap → IP^-1).

Write the Feistel equations: Li = Ri-1 and Ri = Li-1 ⊕ F(Ri-1, Ki).

Explain the 4 steps inside Function F: Expansion (32 to 48 bits), Key XOR, 8 S-Boxes (48 to 32 bits), and P-Box.

Data Encryption Standard (DES): 16-Round Feistel Structure & 3DES