Scribd
Upload
66 views

Crypto Midsem

This document contains a 6-question midterm exam on cryptography and network security. The exam covers topics like: 1) Proving properties of the MixColumn operation in AES. 2) Describing the decryption algorithm for AES-128. 3) Proving that a simple XOR cipher with random keys provides perfect secrecy. 4) Analyzing the collision and preimage resistance of a compression function built from AES-128. 5) Proving a property of the SubBytes operation in AES. 6) Distinguishing a black box implementing DES from another random function, given access to make queries.

Uploaded by

SUBODH SINGH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
66 views

Crypto Midsem

This document contains a 6-question midterm exam on cryptography and network security. The exam covers topics like: 1) Proving properties of the MixColumn operation in AES. 2) Describing the decryption algorithm for AES-128. 3) Proving that a simple XOR cipher with random keys provides perfect secrecy. 4) Analyzing the collision and preimage resistance of a compression function built from AES-128. 5) Proving a property of the SubBytes operation in AES. 6) Distinguishing a black box implementing DES from another random function, given access to make queries.

Uploaded by

SUBODH SINGH
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CS304: Introduction to Cryptography & Network Security

Midsem (Scan and Upload) Marks: 10


Course Instructor: Dr. Dibyendu Roy Exam Date: Mar 10, 2022, Time: 40 min
Instructions: Clearly write your name and roll number on the top of each page. Solutions must be
written clearly. Upload the scanned copy of your handwritten answer script.

Problem 1 2 marks
Prove (or disprove) that Mixcolumn(23, 45, 78, 112) = (103, 239, 54, 186). Here input and output
are given in integer.

Problem 2 2 marks
Write down the decryption algorithm of AES-128. Give proper justifications.

Problem 3 2 marks
Prove that the encryption technique C = Enc(M, K) = M ⊕ K will provide perfect secrecy, where
M ∈ {0, 1}3 and key K is selected randomly from {0, 1}3 .

Problem 4 1 mark
Consider the AES-128 encryption algorithm. AES-128 encryption algorithm takes an 128-bit key
and an 128-bit message block and generates 128-bit ciphertext block (AES-128(M,K)=C) i.e., AES-
128: {0, 1}128 × {0, 1}128 → {0, 1}128 . Define the compression function h : {0, 1}256 → {0, 1}128 by
using the following rule
h(m1 ||m2 ) = AES-128(m1 , m2 ).
Check whether h is collision resistant and preimage resistant compression function or not. Provide
your justification against your answer.

Problem 5 2 marks
Prove that Subbytes(A7) = 5C. Here input and output are given in hexadecimal form.

Problem 6 1 mark
64 64 64
Let F be the set of all functions from {0, 1} × {0, 1} to {0, 1} . You have been given two
black boxes with two functions F1 , F2 from F and it is mentioned that one function among F1 , F2
is DES. Given these two black boxes how do you distinguish the black box which has DES? These
two black boxes will produce outputs corresponding to your polynomial many queries.

You might also like