Scribd
Upload
80 views3 pages

Cyber Security

The SDES algorithm uses a 10-bit key to encrypt 8-bit blocks of plaintext into ciphertext blocks. It has 2 rounds and generates round keys by permuting and shifting the main key. Encryption applies an initial permutation, complex function consisting of expansion, substitution, and permutation twice, and final permutation. Decryption follows the same steps in reverse order.

Uploaded by

Sugam Giri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
80 views3 pages

Cyber Security

The SDES algorithm uses a 10-bit key to encrypt 8-bit blocks of plaintext into ciphertext blocks. It has 2 rounds and generates round keys by permuting and shifting the main key. Encryption applies an initial permutation, complex function consisting of expansion, substitution, and permutation twice, and final permutation. Decryption follows the same steps in reverse order.

Uploaded by

Sugam Giri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Question 01.

1. Briefly mention the general characteristics of the SDES algorithm.


The general characteristics of the SDES algorithm are:
 Input (Plaintext) Block: 8-bit block
 Output (Ciphertext) Block: 8-bit block
 Key: 10-bit key
 Number of Rounds: 2
 Round Keys are generated using Permutation and left shifts (LS)
 Encryption takes place using IP, Round function and switching.
 Decryption takes place in similar steps to encryption except the round keys are used
in the opposite order.

Question 02.

2. Write down the round key generation algorithm for SDES algorithms.
The round key generation algorithm for SDES algorithm are as follows:
1. Apply P10 to the 10-bit key.
2. Apply LS-1 to the output from step 1.
3. Apply p8 to the output after LS-1 which gives us the first key of 8-bit.
4. Apply LS-2 to the LS-1 from step 2
5. Apply P8 to the output of LS-2 from 4 th step which gives us the second key of
8-bit.

Question 03.

3. Briefly elaborate on the encryption steps for the SDES algorithm

The encryption steps for the SDES algorithm are:

1. Initial Permutation
2. Complex function (fk): It is the combination of permutation and substitution
functions. This round is repeated twice in each encryption and decryption.
Components of fk are:
 Expanded Permutation (EP): It takes a 4-bit input and converts it into
an 8-bit output.
 S-boxes (S0 and S1): A basic component of a symmetric key algorithm
that performs substitution.
 Permutation P4
3. A simple permutation function that switches (SW) the two halves of data.
4. The complex function fk again.
5. IP -1.

Question 04.

4. Why is it necessary to use E/P on the 4-bit halves of the plain text during the
encryption process of the SDES algorithm?
The E/P (Extension/Permutation) operation is used to expand the right section of the
4-bit plain text to 8-bit so that the XOR operation may be conducted with the 8-bit
round key or the first key established during the early beginning stages. Because the
XOR operation can only be conducted with two equal numbers of bits, E/P is
necessary to extend the four-bit halves to eight bits so that the XOR operation can
be performed with the round key.

Question 05.

5. In what way do you think can we decipher the cipher text to the original plain
text, which is produced using the SDES algorithm?
Simply reverse the encryption process using the same key that was used to encrypt
the plaintext to decrypt the ciphertext produced by the SDES algorithm. This entails
carrying out the following steps:
 The ciphertext is divided into two groups of four bits each.
 Each group is then run through the same substitution box (S-box) used in the
encryption process, which replaces the bits with new values based on the
lookup table.
 The two sets of bits that arise are then permuted (rearranged) using the
identical permutation pattern that was used in the encryption procedure.
 The resulting bits are then XORed (exclusive-ORed) with the 10-bit key.
 Following another permutation step, the resultant bits are transmitted through
the same S-box employed in the encryption procedure.
 The final resulting bits are then concatenated to form the plaintext.
This process is then repeated for each block of ciphertext, using the same key that
was used to encrypt the plaintext in the first place. You should be able to extract the
original plaintext from the ciphertext as a result of this.

You might also like