Cryptography

• Chapter 1: Introduction and Classical Ciphers. Notes and past questions on Introduction and Classical Ciphers for TU BSc CSIT Cryptography.
• Chapter 2: Symmetric Ciphers. Notes and past questions on Symmetric Ciphers for TU BSc CSIT Cryptography.
• Chapter 3: Asymmetric Ciphers. Notes and past questions on Asymmetric Ciphers for TU BSc CSIT Cryptography.
• Chapter 4: Cryptographic Hash Functions and Digital Signatures. Notes and past questions on Cryptographic Hash Functions and Digital Signatures for TU BSc CSIT Cryptography.
• Chapter 5: Authentication. Notes and past questions on Authentication for TU BSc CSIT Cryptography.
• Chapter 6: Network Security and Public Key Infrastructure. Notes and past questions on Network Security and Public Key Infrastructure for TU BSc CSIT Cryptography.
• Chapter 7: Malicious Logic. Notes and past questions on Malicious Logic for TU BSc CSIT Cryptography.

• Feistel Cipher Structure and AES Key Expansion (2082)
• Illustrate the man in middle attack in Diffie-Hellman key exchange protocol. Assume the prime number be 19 and 10 as its primitive root.... (2082)
• Describe the properties of hash functions. Discuss how hash value is generated using SHA-1 algorithm.[10] (2082)
• Describe any three types of malicious logic. [5] (2082)
• Given the key "HELLOWORLD", encrypt the plaintext "TURINGTEST" using Play fair cipher. [5] (2082)
• Explain any two modes of block cipher encryption. [5] (2082)
• Describe the working mechanism of digital signature algorithm. [5] (2082)
• State Fermat's theorem with example. What is the implication of discrete logarithm? [5] (2082)
• List and explain the types of firewall. [5] (2082)
• Define authentication system. Discuss about challenge response system. [5] (2082)
• Decrypt the ciphertext 'HI' using Hill Cipher where the key is. Ciphertext: HI, Key: $$\begin{bmatrix} 5 & 3 \\ 4 & 3 \end{bmatrix}$$ (2082)
• What is digital certificate? Discuss the certificate life cycle. [5] (2082)
• Tracing the First Full Round of IDEA Algorithm IDEA (International Data Encryption Algorithm) is a symmetric block cipher that operates o... (2081)
• What is Message Authentication Code? List the operation of computing digest value in different passes of MD4. Describe about Needhom-Schr... (2081)
• Why do we need discrete logarithm? Illustrate with an example. Consider a Diffie-Hellman scheme with a common prime p = 13 between user A... (2081)

Frequently asked questions

Based on the official syllabus.