(4 points) In this problem, we will work through a round of DES.

For notational simplicity, assume it is the first round.

Please enter all answers as strings of 0's and 1's.

The input is the 64-bit block

0000000000000000000000010000000000000001000000100000010000000010

Suppose that the subkey for the current round is this 48-bit number:

000000000000000000000000000000100000000000000000

What does the 64-bit state look like after the IP transformation is applied to the input?

Now find L0L0 and R0R0, the left and right halves of the state. L0=

R0=

What is the result of applying the expansion box to R0R0?

E(R0)=

What is the result of XORing the subkey with E(R0)E(R0)?

k1E(R0)=

We now apply the S-box transformation.

S(k1E(R0))=

Finally, we apply the permutation box to complete the function ff.

f(R0)=P(S(k1E(R0)))=

We can now compute the state of DES going into the next round.

L1=

R1=

(4 points) In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of O's and 1's. The input is the 64 bit block 0000000000000000000000010000000000000001000000100000010000000010 Suppose that the subkey for the current round is this 48 bit number: 000000000000000000000000000000100000000000000000 What does the 64 bit state look like after the IP transformation is applied to the input? Now find Lo and Rothe left and right halves of the state. Lo Ro What is the result of applying the expansion box to Ro? E(R) What is the result of XORing the subkey with E(R)? k E(R) We now apply the S-box transformation. S(ki E(R)) = Finally we apply the permutation box to complete the function f. f(Ro) = P(S(kie E(R))) We can now compute the state of DES going into the next round. L R