Gandhinagar Institute of Technology
Information Technology Department
Question Bank
Academic Year (2023-2024)
Subject Code: 3161606
Subject Name: Cryptography and Network Security
UNIT -1:
1. Describe the term: Authentication, Authorization, Integrity and Non – repudiation.
2. Explain the Euclidean algorithm.
3. Describe the term: Finite fields – group, ring, fields, modular arithmetic.
4. Describe various Security Mechanisms in detail.
5. Difference between Active and Passive security threats.
6. Find out the inverse of 12 with extended Euclidean algorithm in Galois Field 79.
7. Explain the following terms in brief a)Confidentiality b)Acess control c)Non- repudiation.
8. show the steps of Euclid’s algorithm to find gcd(401,700).
UNIT -2:
1. Explanation generation of encryption matrix in play fair cipher.
2. Explain various steps of AES in short.
3. Explain Symmetric Cipher Model
4. Differentiate Substitution and Transposition techniques.
5. Define the term: Cryptography, Cryptanalysis
UNIT -3:
1. Difference between Stream ciphers and block ciphers
2. Explain block cipher structure.
3. Discuss DES with an example.
4. Describe the design principle of block cipher.
5. Explain AES with its structure.
6. Explain AES transformation functions.
GIT/ACADEMICS/SUBJECT FILE/Subject File Format_R0 www.git.org.in
7. Encrypt the message “Exam” using the Hill cipher with the key values k11=9, k12=4, k21=5,
k22=7.
8. what do you mean by Key expansion? how to do it?
9. Encrypt the following text using caesar cipher using the key having the value=3 “WELCOME
TO THE COURSE INFORMATION AND NETWORK SECURITY”.
10. Discuss the use of S-box in DES.
UNIT -4:
1. Explain multiple encryption and triple DES.
2. Discuss Electronic Code Book.
3. Explain Cipher Block Chaining Mode.
4. Differentiate between Cipher Feedback mode, Output Feedback mode, and Counter
mode.
UNIT -5:
1. Explain Public Key Cryptosystems with Applications.
2. Discuss RSA algorithm with an example.
3. Explain Diffie-Hillman Key Exchange algorithm.
4. Describe Man-in-Middle attack.
5. Perform encryption and decryption using the RSA algorithm for p=3, q=11, e=7, M=5.
6. In a public key system using RSA, the cipher text intercepted is C=12 which is sent to the
user whose public key is e=5, n=35. What is the plaintext M?
7. User A & B exchange the key using Diffie Hellman algorithm Assume public numbers P=17
G=2 and private values X=3 Y=7 respectively. Find the Public Value R1,R2 and key K of user A and B.
UNIT -6:
1. Explain Cryptographic Hash Functions and their applications.
2. Discuss Simple hash functions, its requirements and security.
3. Discuss SHA and its application in real time.
4. Differentiate between hashing and encryption. What are the practical applications of hashing?
5.Compare MD5 and SHA1 hashing algorithms.
GIT/ACADEMICS/SUBJECT FILE/Subject File Format_R0 www.git.org.in
UNIT -7:
1. How Message Authentication Codes work?
2. Explain MACs based on Hash Functions.
3. Discuss Macs based on Block Ciphers.
UNIT -8:
1. Explain Digital Signature, its properties, requirements and security aspects.
2. Explain various digital signature schemes.
3. Discuss NIST digital signature algorithm.
4. Discuss Schnorr digital signature scheme in detail
5. Describe Elgamal digital signature.
UNIT -9:
1. Explain Key management and its distribution methods.
2. Differentiate symmetric key distribution using symmetric and asymmetric encryptions.
3. Discuss Public key infrastructure.
4. Explain X.509 certificates.
5. What is the difference between a session key and a master key? List four general categories of
schemes for the distribution of public keys.
UNIT -10:
1. Explain Remote user authentication with symmetric and asymmetric encryption.
2. Discuss Kerberos.
UNIT -11:
1. Discuss Web Security threats and approaches.
2. How SSL architecture and protocol work?
3. Explain various Transport layer security approaches.
4. Describe HTTPS and SSH.
5. Differentiate HTTP and HTTPS.
GIT/ACADEMICS/SUBJECT FILE/Subject File Format_R0 www.git.org.in
