Question: This problem provides a numerical example of encryption using a one-round version of DES. We start with the same bit pattern for the key K

This problem provides a numerical example of encryption using a one-round version of DES. We start with the same bit pattern for the key KK and the plaintext, namely:

Hexadecimal notation: Binary notation: 0123456789 ABCDEF 0000 0001 0010 0011 0100 0101

a. Derive K1K1, the first-round subkey.

b. Derive L0,R0L0,R0.

c. Expand R0R0 to get E[R0]E[R0], where E[]E[] is the expansion function of Table 3.2.

d. Calculate A=E[R0]K1A=E[R0]K1.

e. Group the 48-bit result of (d) into sets of 6 bits and evaluate the corresponding S-box substitutions.

f. Concatenate the results of (e) to get a 32-bit result, BB.

g. Apply the permutation to get P(B)P(B).

h. Calculate R1=P(B)L0R1=P(B)L0.

i. Write down the ciphertext.

Hexadecimal notation: Binary notation: 0123456789 ABCDEF 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111

Step by Step Solution

3.45 Rating (158 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a First pass the 64bit input through PC1 Table 34a to produce a 56bit result Then perform a left circular shift separately on the two 28bit halves Fin... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Cryptography And Network Security Questions!