Scribd
Upload
53 views4 pages

Simplified DES (S-DES) Has Similar Properties and Structure To DES With Much Smaller Parameters (See Following S-DES Scheme)

S-DES is a simplified version of DES with smaller parameters. It uses permutations and substitutions for key generation and encryption similar to DES. The key generation involves permutations P10 and P8 as well as left shifts. Encryption uses an initial permutation IP and final permutation IP-1, as well as an expansion permutation E/P, substitution boxes S0 and S1, XOR, and permutation P4 as part of the function fK.

Uploaded by

prasath
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 DOC, PDF, TXT or read online on Scribd
53 views4 pages

Simplified DES (S-DES) Has Similar Properties and Structure To DES With Much Smaller Parameters (See Following S-DES Scheme)

S-DES is a simplified version of DES with smaller parameters. It uses permutations and substitutions for key generation and encryption similar to DES. The key generation involves permutations P10 and P8 as well as left shifts. Encryption uses an initial permutation IP and final permutation IP-1, as well as an expansion permutation E/P, substitution boxes S0 and S1, XOR, and permutation P4 as part of the function fK.

Uploaded by

prasath
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 DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Simplified DES Simplified DES (S-DES) has similar properties and structure to DES with much smaller parameters

(See following S-DES scheme).

Following is the key generation process:

Where P10 is a permutation with table: 3 5 2 7 4 P10 10 1 9 8 6

LS-1 is a circular left shift of 1 bit position, and LS-2 is a circular left shift of 2 bit positions. P8 is another permutation with the following rule: P8 6 3 7 4 8 5 10 9

Encryption:

IP is the initial permutation and IP-1 is its inverse. IP 2 6 3 1 4 IP-1 7

Function fK consists of a combination of permutation and substitution functions. fK(L, R) = (L F(R, SK), R) where SK is a subkey (i.e. K1 or K2). E/P is an expansion permutation, with the following rules: E/P 4 1 2 3 2 3

S0 and S1 are to S-boxes operates according to the following tables: S0: 1 0 3 2 3 2 1 0 0 2 1 3 3 1 3 2 S1: 0 2 3 2

1 0 0 1

2 1 1 0

3 3 0 3

And P4 would be another permutation. 2 3 P4 4 1

You might also like