Question: Problem 1 Consider polyalphabetic substitution using the following three keys: K1: abcdefghijklmnopqrstuvwxyz badcfehgjilknmporqtsvuxwzy K2: abcdefghijklmnopqrstuvwxyz zyxwvutsrqponmlkjihgfedcba K3: abcdefghijklmnopqrstuvwxyz edcbakjihfgsrqponmlzxyvuwt Suppose the keys are used cyclically
Problem 1 Consider polyalphabetic substitution using the following three keys:
K1: abcdefghijklmnopqrstuvwxyz badcfehgjilknmporqtsvuxwzy
K2: abcdefghijklmnopqrstuvwxyz zyxwvutsrqponmlkjihgfedcba
K3: abcdefghijklmnopqrstuvwxyz edcbakjihfgsrqponmlzxyvuwt
Suppose the keys are used cyclically in the order K1, K2, K3, K1, K2, K3, etc. What will be the encryption of the message abracadabra?
Problem 2 Consider the 3-bit block cipher in slide 8-18. Suppose the plaintext is 101101101. If CBC is used with initial vector 110, what will be the resulting ciphertext? Show work, not just the final answer.
Problem 3 Consider RSA with public key (n, e) and private key (n, d) where n = 35, e = 5, and d = 29. What is the encryption of m = 34? What is the decryption of c = 34? Show calculations, not just final answers.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
