Cryptography and Network Security
1. Define security attack. Classify security attacks into different types with suitable
examples.
2. Explain the following security services in detail:
a) Confidentiality
b) Integrity
c) Authentication
d) Non-repudiation
3. What are security mechanisms? Differentiate between specific security mechanisms and
pervasive security mechanisms.
4. Explain the Caesar Cipher with a clear encryption and decryption example.
5. What is a Monoalphabetic Substitution Cipher? Why is it considered insecure?
6. Describe the Playfair Cipher. Encrypt the plaintext “SECURITY” using a suitable key.
7. Explain the Rail Fence Transposition Cipher with an example.
8. Compare Substitution Ciphers and Transposition Ciphers with respect to working
principle and security.
9. Define cryptanalysis. What are the main objectives of cryptanalysis?
10. Explain the following cryptanalytic attacks:
a) Ciphertext-only attack
b) Known-plaintext attack
c) Chosen-plaintext attack
11. Why are classical ciphers vulnerable to cryptanalysis? Explain with reasons.
12. Define steganography. How is it different from cryptography?
13. Explain Image-based Steganography using the Least Significant Bit (LSB) technique.
14. List the advantages and limitations of steganography.
15. Differentiate between Stream Ciphers and Block Ciphers with examples.
16. Explain the basic working of a Stream Cipher using a simple diagram.
17. Explain the principles of block ciphers. What is the importance of multiple rounds in
block cipher design?
18. Describe Shannon’s Theory of Confusion and Diffusion. How are these concepts
implemented in modern block ciphers?
19. Explain the Feistel Structure with a neat block diagram. Why is it widely used in block
cipher design?
20. Explain the Data Encryption Standard (DES) in detail. Discuss:
a) Strength of DES
b) Idea of Differential Cryptanalysis
c) Need for Triple DES (3DES)
21. Encrypt the plaintext “NETWORK” using the Caesar Cipher with a key value of +4.
Also, show the decryption process step by step.
22. Using the following substitution key:
Plain A B C D E F G H
Cipher Q W E R T Y U I
Encrypt the plaintext “BAD” and decrypt the ciphertext “WQT” by using
Monoalphabetic Substitution Cipher method.
23. Rail Fence Cipher Numerical
Encrypt the plaintext “CRYPTOGRAPHY” using the Rail Fence Cipher with 3 rails.
Show the rail diagram clearly.
24. DES Block Size Numerical
DES uses a 64-bit block size.
a) How many blocks are required to encrypt a plaintext of 1024 bits?
b) How many padding bits are required if the plaintext size is 1000 bits?
25. Triple DES Numerical
Triple DES uses three 56-bit keys.
a) Calculate the effective key length of 3DES.
b) Compare the key strength of DES and 3DES numerically.
c) Explain why 3DES is more secure than DES based on key length.
26. Explain the need for Advanced Symmetric Key Cryptography. How is it different from
classical symmetric cryptography?
27. Describe the overall structure of AES with a neat block diagram.
28. AES consists of multiple rounds. Explain the following AES transformations:
a) SubBytes b) ShiftRows c) MixColumns d) AddRoundKey
29. What is the purpose of the SubBytes transformation in AES? Explain using an example.
30. Explain the ShiftRows transformation with an example using a 4 × 4 state matrix.
31. Describe the MixColumns transformation and explain why it provides diffusion.
32. Explain the AES encryption process step by step.
33. Explain the AES decryption process. How is it different from encryption?
34. Compare DES and AES in terms of block size, key size, security and performance.
35. State and explain Fermat’s Little Theorem with an example.
36. State and explain Euler’s Theorem. How is it related to Fermat’s theorem?
37. Find φ(n) using Euler’s Totient Function for:
a) n = 15 b) n = 21
38. Verify Euler’s theorem for:
a = 2, n = 9
39. Explain the importance of Fermat’s and Euler’s theorem in cryptography.
40. What is a prime number? Explain the importance of prime numbers in cryptography.
41. Explain the Chinese Remainder Theorem (CRT) with a suitable example.
42. Solve the following using Chinese Remainder Theorem:
x ≡ 2 (mod 3)
x ≡ 3 (mod 5)
x ≡ 2 (mod 7)
43. Define the Discrete Logarithmic Problem (DLP). Why is it difficult to solve?
44. Solve the discrete logarithm:
Find x such that
2ˣ mod 11 = 8
45. Explain the role of the Discrete Logarithmic Problem in cryptography.
46. Explain the principles of Public Key Cryptography. How is it different from symmetric
key cryptography?
47. List and explain the requirements of a public key cryptosystem.
48. Explain the RSA algorithm including:
a) Key generation b) Encryption c) Decryption
49. Given:
p = 3, q = 11, e = 7, plaintext M = 5
Using RSA algorithm Find:
a) Public key b) Private key c) Ciphertext d) Decrypted plaintext
50. Explain the security of RSA algorithm. Why is RSA considered secure? What attacks are
possible on RSA?