APPLIED CRYPTOGRAPHY (CS6530), IIT MADRAS

Total Time : 1hour Tutorial 2

Max Marks : 20 6/1/2018

1. Let n be a positive integer. A Latin Square of order n is an n × n array L of the integers 1,2,3,. . . , n such that
every one of the n integers occurs exactly once in each row and each column L. An example of a Latin square of
1 2 3
order 3 is as follows: 3 1 2 . Given any latin square L of order n, we can define a related cryptosystem. Take
2 3 1
P = C = K = {1, 2, 3, · · · n}. For 1 ≤ i ≤ n, the encryption rule Ei is defined to be Ei (j) = L(i, j). Hence each row
of L gives rise to one encryption rule.
Give a proof that this Latin Square crptosystem achieves perfect secrecy provided that every key is used with equal
probability.
2. Alice and Bob decide to use the one time pad to achieve perfect secrecy. However they made one single mistake.
They used inclusive-or instead of exclusive-or. Would the scheme still achieve perfect secrecy (and why)? Compute
the probabity, with which Mallory can determine the encrypted plaintext.
3. In the one time pad, encryption is done as follows: Ek (p) = k ⊕ p = c, where k, p, and c are l bit numbers. If k = 0l ,
then notice that the plaintext is transmitted in the clear. It is therefore suggested to improve the one time pad by
encrypting with a key k 6= 0l . Is this an improvement? In particular, is this scheme still perfectly secure? Prove
your answer.
4. Prove that Perfect Indistinguishability implies Perfect Secrecy.
5. Prove that H(X, Y ) = H(Y ) + H(X|Y ).

APPLIED CRYPTOGRAPHY (CS6530), IIT MADRAS

Total Time : 1hour Tutorial 2
Max Marks : 20 6/1/2018

1. Let n be a positive integer. A Latin Square of order n is an n × n array L of the integers 1,2,3,. . . , n such that
every one of the n integers occurs exactly once in each row and each column L. An example of a Latin square of
1 2 3
order 3 is as follows: 3 1 2 . Given any latin square L of order n, we can define a related cryptosystem. Take
2 3 1
P = C = K = {1, 2, 3, · · · n}. For 1 ≤ i ≤ n, the encryption rule Ei is defined to be Ei (j) = L(i, j). Hence each row
of L gives rise to one encryption rule.
Give a proof that this Latin Square crptosystem achieves perfect secrecy provided that every key is used with equal
probability.
2. Alice and Bob decide to use the one time pad to achieve perfect secrecy. However they made one single mistake.
They used inclusive-or instead of exclusive-or. Would the scheme still achieve perfect secrecy (and why)? Compute
the probabity, with which Mallory can determine the encrypted plaintext.
3. In the one time pad, encryption is done as follows: Ek (p) = k ⊕ p = c, where k, p, and c are l bit numbers. If k = 0l ,
then notice that the plaintext is transmitted in the clear. It is therefore suggested to improve the one time pad by
encrypting with a key k 6= 0l . Is this an improvement? In particular, is this scheme still perfectly secure? Prove
your answer.
4. Prove that Perfect Indistinguishability implies Perfect Secrecy.
5. Prove that H(X, Y ) = H(Y ) + H(X|Y ).