4. DES Illustration This problem provides a numerical example of encryption using a one-round ver- sion of DES Hexadecimal notation: Binary notation 0123456789 ABCDEF 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 a. Derive Ki, the first-round subkey b. Derive Lo, Ro c. Expand R, to get EIR),where Elt1 is the expansion function of Table S.1. d. Calculate A-EIR,lKv Group the 48-bit result of (d) into sets of 6 bits and evaluate the corresponding S-box substitutions Concatenate the results of (e) to get a 32-bit result, B. Apply the permutation to get P(B) Calculate Ri-P(B) 4. t. i. Write down the