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 and the plaintext, namely: Hexadecimal notation: 0123456789ABCDEF Binary notation: 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 Ro to get E[Rol, where El is the expansion function of Table S.1. d. Calculate A= El Rol??, e. Group the 48-bit result of (d) into sets of 6 bits and evaluate the corresponding f. g. h. i. S-box substitutions Concatenate the results of (e) to get a 32-bit result, B Apply the permutation to get P(B) Calculate R1=P(B)?4 Write down the ciphertext. (a) Initial Permutation (IP) 20 12 32 33 27 41 17 13 15 31 (b) Inverse Initial Permutation 1P-1) 16 15 7 55 31 ? 37 13 12 21 61 28 51 18 41 (c) Expansion Permutation (E) 12 20 17 14 16121 31 (d) Permutation Function (P 12 18 16 8 23 13 10 14 19