Question: This problem provides a numerical example of encryption using a one-round version of DES. We start with: L0= 1101 1100 0000 0000 1100 1100 1111
- This problem provides a numerical example of encryption using a one-round version of DES. We start with:
L0= 1101 1100 0000 0000 1100 1100 1111 1111
R0= 1111 0001 1010 1010 1111 0000 1010 1010.
The first round key K1= 0000 1010 0000 0010 0110 0111 1010 1011 0100 1001 1010 0101.
Please calculate the following values:
(a)A=Ex[R0]K1.
(b) The output of S-boxes.
(c)L1andR1.
Hint: Ex[] is the expansion permutation. Use the tables referenced in the DES at https://en.wikipedia.org/wiki/DESsupplementarymaterial
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
