Suppose that a cryptosystem has two keys k1 and k2, three messages m1, m2, and m3, and three…

Suppose that a cryptosystem has two keys k1 and k2, three messages m1, m2, and m3, and three ciphertexts c1, c2, and c3. Assume that the probability function for the message variables are as follows: pM (m1) = pM (m2) = 1 4 pM (m3) = 1 2 Suppose that the following table describes how the different keys act on the messages to produce ciphertexts: Assuming that all keys are equally likely compute the key equivo- m1 m2 m3 k1 c2 c1 c3 k2 c3 c3 c2 m1 m2 m3 k1 c2 c4 c1 k2 c1 c3 c2 k3 c3 c1 c2 Table 1: An Encryption Function cation of the cryptosystem