This document is the mid-semester examination for the subject Cryptographic Foundations from the National Institute of Technology Rourkela Department of Computer Science and Engineering. It contains 3 questions to be answered in 2 hours. Question 1 has 5 parts related to the extended Euclidean algorithm, multiplicative inverses, linear Diophantine equations, Euler's totient function, and modular exponentiation. Question 2 has 5 parts related to the Playfair cipher, Fermat's Little theorem, linear feedback shift registers, DES encryption components, and CFB mode encryption. Question 3 has 5 parts related to confusion and diffusion, multiplication in a Galois field, finding inverses in a Galois field, AES key expansion, and properties of
This document is the mid-semester examination for the subject Cryptographic Foundations from the National Institute of Technology Rourkela Department of Computer Science and Engineering. It contains 3 questions to be answered in 2 hours. Question 1 has 5 parts related to the extended Euclidean algorithm, multiplicative inverses, linear Diophantine equations, Euler's totient function, and modular exponentiation. Question 2 has 5 parts related to the Playfair cipher, Fermat's Little theorem, linear feedback shift registers, DES encryption components, and CFB mode encryption. Question 3 has 5 parts related to confusion and diffusion, multiplication in a Galois field, finding inverses in a Galois field, AES key expansion, and properties of
This document is the mid-semester examination for the subject Cryptographic Foundations from the National Institute of Technology Rourkela Department of Computer Science and Engineering. It contains 3 questions to be answered in 2 hours. Question 1 has 5 parts related to the extended Euclidean algorithm, multiplicative inverses, linear Diophantine equations, Euler's totient function, and modular exponentiation. Question 2 has 5 parts related to the Playfair cipher, Fermat's Little theorem, linear feedback shift registers, DES encryption components, and CFB mode encryption. Question 3 has 5 parts related to confusion and diffusion, multiplication in a Galois field, finding inverses in a Galois field, AES key expansion, and properties of
This document is the mid-semester examination for the subject Cryptographic Foundations from the National Institute of Technology Rourkela Department of Computer Science and Engineering. It contains 3 questions to be answered in 2 hours. Question 1 has 5 parts related to the extended Euclidean algorithm, multiplicative inverses, linear Diophantine equations, Euler's totient function, and modular exponentiation. Question 2 has 5 parts related to the Playfair cipher, Fermat's Little theorem, linear feedback shift registers, DES encryption components, and CFB mode encryption. Question 3 has 5 parts related to confusion and diffusion, multiplication in a Galois field, finding inverses in a Galois field, AES key expansion, and properties of
Mid-Semester Examination (Autumn) 2018 Subject: Cryptographic Foundation Subject Code: CS 325 Full Marks: 30 Duration: 2 Hours Answer ALL questions. Figures at the right margin indicate marks. All parts of a question must be answered at one place. 1. (a) Using extended Euclidean algorithm, find the greatest common divisor among 291 and 42. Also find the value of s and t. [2] (b) Find the multiplicative inverse of 48 in Z281 . [2] (c) Find the particular and the general solutions to the following linear Diophantine equation. [2] 40x + 16y = 88 (d) What is the value of Φ(36) and Φ(230), where Φ is the Euler’s Totient/phi function? [2] (e) Find the value of x such that 216 mod x = 1. [2] 2. (a) Bob received a message ”oipotyhpmy” from Alice. He knows that Alice used the following key and the playfair cipher technique for encryption. What was the massage sent by Alice to Bob? [2] A B C D E F G H I/J K L M N O P Q R S T U V W X Y Z (b) State Fermat’s Little theorem. Reduce the expression 425 mod 17 to Fermat’s Little theorem and then find it’s value. [2] (c) Create a linear feedback shift register with 6 cells in which b6 = b5 ⊕ b3 ⊕ b2 ⊕ b0 . Show the value of output for 10 transitions if the seed is 101001. [2] (d) Briefly describe the various components used in a round of DES at the sender site. [2] (e) With neat diagram explain the processes of encryption and decryption in CFB mode. List the advantages and disadvantages of CFB mode. [2] 3. (a) What do you mean by confusion and diffusion? [2] 3 2 2 4 4 3 (b) Show how to multiply (x + x + x + 1) by (x + x) in GF(2 ) using (x + x + 1) as modulus. [2] (c) Find the inverse of (x4 + x3 + 1) in GF(25 ) using the modulus (x5 + x2 + 1) [2] (d) Explain with suitable block diagram the key expansion procedure in AES-128. [2] ∗ (e) For the group < G = Z19 , × > : [2] i. Find the order of the group ii. Find the primitive roots in the group iii. show that the group is cyclic ———— END ————