Question: Problem 1 . Use exhaustive key search to decrypt the following ciphertext, which was encrypted using a Shift Cipher:BEEAKFYDJXUQYHYJIQRYHTYJIQFBQDUYJIIKFUHCQD Problem 2 . Suppose we are

Problem 1. Use exhaustive key search to decrypt the following ciphertext, which was encrypted using a Shift Cipher:BEEAKFYDJXUQYHYJIQRYHTYJIQFBQDUYJIIKFUHCQD Problem 2. Suppose we are told that the plaintextbreathtakingyields the ciphertextwhere the Hill Cipher is used. Determine the encryption matrix.Problem 3. Let M ={a,b} with Pr[a]=0.25, Pr[b]=0.75. Let K ={k1,k2,k3} with Pr[k1]=0.5, Pr[k2]= Pr[k3]=0.25. Let C ={1,2,3,4}, and suppose the encryption functions are defined to be:1. Enc(k1, a)=1, Enc(k1, b)=22. Enc(k2, a)=2, Enc(k2, b)=33. Enc(k3, a)=3, Enc(k3, b)=4Compute the probability distribution on C.Problem 4. Let M ={a, b} and let K ={k1, k2, k3, k4, k5}. Let C ={1,2,3,4,5}, and suppose the encryptionfunctions are defined to be:1. Enc(k1, a)=1, Enc(k1, b)=22. Enc(k2, a)=2, Enc(k2, b)=33. Enc(k3, a)=3, Enc(k3, b)=14. Enc(k4, a)=4, Enc(k4, b)=55. Enc(k5, a)=5, Enc(k5, b)=4Now choose two positive real numbers s and t such that s + t =1, and define Pr[k1]= Pr[k2]= Pr[k3]=3s and Pr[k4]= Pr[k5]=2t . Prove that this cryptosystem achieves perfect secrecy.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!