4.11 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: Binary notation: 0123456789ABCDEF 0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 a. Derive K1, the first-round subkey. b. Derive Lo, Ro- c. Expand Ro to get E[Ro], where E[ ] is the expansion function of Table S.1. d. Calculate A = E[Ro] K₁. 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, B. 22 CHAPTER 4/BLOCK CIPHERS AND THE DATA ENCRYPTION STANDARD g. Apply the permutation to get P(B). h. Calculate R₁ = P(B) Lo i. Write down the ciphertext. 4.12 Compare the initial permutation table (Table S.1a) with the permuted choice one