Scribd
Upload
16 views4 pages

3.6 DES (Data Encryption Standard)

The Data Encryption Standard (DES) is a widely used encryption scheme established in 1977, which encrypts data in 64-bit blocks using a 56-bit key. The Simplified Data Encryption Standard (S-DES) is a simpler version of DES, utilizing an 8-bit block of plaintext and a 10-bit key, producing an 8-bit block of ciphertext. Key generation in S-DES involves permutations and shifts to create two 8-bit subkeys from the original 10-bit key.

Uploaded by

anjalpandit31
Copyright
© © All Rights Reserved
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
16 views4 pages

3.6 DES (Data Encryption Standard)

The Data Encryption Standard (DES) is a widely used encryption scheme established in 1977, which encrypts data in 64-bit blocks using a 56-bit key. The Simplified Data Encryption Standard (S-DES) is a simpler version of DES, utilizing an 8-bit block of plaintext and a 10-bit key, producing an 8-bit block of ciphertext. Key generation in S-DES involves permutations and shifts to create two 8-bit subkeys from the original 10-bit key.

Uploaded by

anjalpandit31
Copyright
© © All Rights Reserved
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/ 4

Data Encryption Standard (DES): Data Encryption

Standard (DES) was the most widely used encryption


scheme. DES was issued in 1977 by the National
Bureau of Standards. DES data is encrypted in 64-bit
blocks using a 56-bit key and output of DES
(ciphertext) is also 64-bit block.

SIMPLIFIED DATA ENCRYPTION


STANDARD (S-DES)
It is a block cipher and it is a simple version of the DES
Algorithm. It is used for easily understand DES. It is a
symmetric key cipher i.e. they use the same key for both encryption and decryption. The S-DES
encryption algorithm takes an 8-bit block of plaintext (example: 10111101) and a 10-bit key as input and
produces an 8-bit block of ciphertext as output. The S-DES decryption algorithm takes an 8-bit block of
ciphertext and the same 10-bit key used to produce that ciphertext as input and produces the original 8-
bit block of plaintext.

The encryption algorithm involves


five functions:

 an initial permutation (IP)


 a complex function labeled fk,
which involves both permutation
and substitution operations and
depends on a key input
 a simple permutation function
that switches (SW) the two halves
of the data
 the function fk again
 a permutation function that is
the inverse of the initial
permutation

The function fk takes as input not only the data passing through the encryption algorithm, but also an 8-
bit key. Here a 10-bit key is used from which two 8-bit subkeys are generated. The key is first subjected
to a permutation (P10). Then a shift operation is performed. The output of the shift operation then
passes through a permutation function that produces an 8-bit output (P8) for the first subkey (K1). The
output of the shift operation also feeds into another shift and another instance of P8 to produce the
second subkey (K2).

S-DES key generation: In the key generation algorithm, we accept the 10-bit key and convert it
into two 8 bit keys. This key is shared between both sender and receiver.

In the key generation, we use three functions:


1. Permutation P10

2. Permutation P8

3. Left Shift

Step 1: We accepted a 10-bit key and permuted the bits by putting them in the P10 table.

Key = 1 0 1 0 0 0 0 0 1 0
(k1, k2, k3, k4, k5, k6, k7, k8, k9, k10) = (1, 0, 1, 0, 0, 0, 0, 0, 1, 0)
P10 Permutation is: P10(k1, k2, k3, k4, k5, k6, k7, k8, k9, k10) = (k3, k5, k2, k7, k4, k10, k1, k9, k8, k6)

After P10, we get 1 0 0 0 0 0 1 1 0 0

Step 2: We divide the key into 2 halves of 5-bit each. l=1 0 0 0 0, r=0 1 1 0 0

Step 3: Now we apply one bit left-shift on each key. l = 0 0 0 0 1, r = 1 1 0 0 0

Step 4: Combine both keys after step 3 and permute the bits by putting them in the P8 table. The output
of the given table is the first key K1.
After LS-1 combined, we get 0 0 0 0 1 1 1 0 0 0

P8 permutation is: P8(k1, k2, k3, k4, k5, k6, k7, k8, k9, k10) = (k6, k3, k7, k4, k8, k5, k10, k9)
After P8, we get Key-1 : 1 0 1 0 0 1 0 0
Step 5: The output obtained from step 3 i.e. 2 halves after one bit left shift should again undergo the
process of two-bit left shift.

Step 3 output - l = 0 0 0 0 1, r = 1 1 0 0 0 After two-bit shift - l = 0 0 1 0 0, r = 0 0 0 1 1


Step 6: Combine the 2 halves obtained from step 6 and permute them by putting them in the P8 table.
The output of the given table is the second key K2.

After LS-2 combined = 0 0 1 0 0 0 0 0 1 1


P8 permutation is: P8(k1, k2, k3, k4, k5, k6, k7, k8, k9, k10) = (k6, k3, k7, k4, k8, k5, k10, k9)
After P8, we get Key-2 : 0 1 0 0 0 0 1 1

Final Output:
Key-1 is: 1 0 1 0 0 1 0 0
Key-2 is: 0 1 0 0 0 0 1 1

You might also like