cate an This problem explores the use of a one-time pad version of the Vigenre cipher In this scheme, the key is a stream of random numbers between 0 and 26. For example, if the key is 3 195 then the first letter of plaintext is encrypted with a shift of 3 letters, the second with a shift of 19 letters, the third with a shift of 5 letters, and so on. a Encrypt the plaintext sendmoremoney with the key stream 90 1 7 23 15 21 14 11 11 2 8 9 Using the ciphertext produced in part (a),find a key so that the cipher text decrypts to the plaintext cashnotneeded. b. letter A E MORT V encoding 000 001 010 0 100 101 110 111 A message M = MARIO is Vernam encrypted into ciphertext C = AoAMV: C = M K where shows modulo 2 XOR 0peration. Find the corresponding encryption key. Provide details of your cryptanalaysis. 4. DES Illustration This problem provides a numerical example of encryption using a one-round ver- sion of DES Hexadecimal notati: 0123456789ABCDE Binary notations 0000 0001 0010 0011 0100 0101 01100111 1000 1001 1010 1011 1100 1101 1110 1111 a Derive Ki, the first-round subkey. b. Derive Lo. R c. Expand R) to get El RJ where Eljis the expansion function of Table SI. d. Calculate A -EIRIOK e. 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. e Apply the h. Calculate R.-PB) 4 i Write down the ciphertext to get P(B) The given plain text (in hexadecimal form), P = D2AAF891CEOB6587 Key, K = B0 194D2FA3487EC6 First convert both P and K in binary form using 64 bits (each hex digit by 4 digit binary number as shown). Then answer each of the question given above