Unit 1: Introduction and Classical Ciphers
Unit 2: Symmetric Ciphers
-
Describe the Fiestel Cipher structure.
-
Explain the single round operation in DES. Describe the F function in DES.
-
Write down the encryption and decryption process at 2-DES and 3-DES.
-
State the encryption process of double and triple DES. What is the task of S-Box in DES?
-
Explain the process of key expansion in AES.
-
Explain the procedure of mix column transformation in AES with an example.
-
How encryption is done using IDEA algorithm.
-
Explain the round operation in IDEA.
-
Let us consider the 4 bits key set … Now trace the first full round operation of IDEA algorithm.
-
Describe any two modes of block cipher encryption.
-
Explain the different modes of block cipher.
Unit 3: Asymmetric Ciphers
-
Illustrate the man in middle attack in Diffie–Hellman key exchange protocol.
-
Describe the meet in middle attack in Diffie Hellman key exchange protocol.
-
Define discrete logarithm. Explain the procedure of sharing the secret key in Diffie Hellman.
-
Why do we need discrete logarithm? Illustrate with an example.
-
Define discrete logarithms. How key generation, encryption and decryption is done in RSA.
-
Given p = 61, q = 53. Calculate the public key, private key, and encrypt the message “42”.
-
Explain the process of public key distribution and secret key distribution using public key cryptography.
-
Find whether 3 is primitive root of 7 or not.
-
Show that Z5 is a field. Encrypt the message using ElGamal cryptosystem.
-
Encrypt the message m=13 using ElGamal cryptosystem.
Unit 4: Cryptographic Hash Functions and Digital Signatures
-
List the properties of hash function. Describe the algorithm for SHA-1.
-
Describe the properties of hash functions. Discuss how hash value is generated using SHA-1 algorithm.
-
Compare the SHA parameters between SHA-1 and SHA-2 families.
-
Explain the process of generating message digests using MD4.
-
List the operation of computing digest value in different passes of MD4.
-
Describe the working mechanism of digital signature algorithm.
-
Explain the concept of digital signatures and differentiate between direct and arbitrated digital signatures.
-
Explain the generic model of digital signature process.
-
How digital signature generation and verification is done using RSA.
Unit 5: Authentication
-
Define authentication system. Discuss about challenge response system.
-
Define authentication system. Illustrate the need of mutual authentication over one way authentication.
-
Give the formal definition of authentication system. Describe about one way and mutual authentication system.
-
What is Message Authentication Code?
-
Write down any two limitations of MAC.
-
Describe about Needham-Schroeder protocol.
-
Discuss the working mechanism of kerberos protocol.
-
Why do we need Kerberos?
Unit 6: Network Security and Public Key Infrastructure
-
What is digital certificate? Discuss the certificate life cycle.
-
List the stage of certificate life cycle.
-
Describe the PKI trust model.
-
Define PKI with its architecture model.
-
Explain IP Security (IPSec) and its components.
-
Describe about IPSec.
-
Describe the services provided by Pretty Good Privacy protocol to secure email.
-
Define SSL protocol. Mention the services provided by PGP.
-
List and explain the types of firewall.
-
Define firewall and types of firewalls.
Unit 7: Malicious Logic
-
Describe any three types of malicious logic.
-
What is malicious logic? How zombies are different from trojan horses?
-
Differentiate between Trojan horse and virus.
-
What is intrusion? Explain any two types of intrusion detection system.
-
Explain the concept of a denial of service attack and provide examples.
-
How does the nature of worms differ from viruses?
Miscellaneous / Cross-Chapter Questions
-
Show that the set of integers is Ring under addition and multiplication.
-
Find the multiplicative inverse of polynomial using extended Euclidean Algorithm.
-
Divide polynomials over GF(7) / GF(9).
-
Define Euler totient function with an example.
-
Find GCD using Euclidean algorithm.