Perfect 👍

Now I’ll remove the duplicates from that segregation list while keeping the structure intact.

1. Classical Ciphers
1. Explain the Playfair cipher technique. Encrypt the message “STAY HOME STAY
SAFE”, keyword LARGEST, using the Playfair cipher technique.
2. Describe Caesar cipher and Monoalphabetic cipher techniques with examples.
3. Describe Hill Cipher Technique with an example.
4. Using the Playfair matrix and the keyword MONARCHY, encrypt the message
“Visvesvaraya college”.
5. Using the Playfair matrix and the keyword MONARCHY, encrypt the message
“Meet at five”.
6. Explain Playfair cipher technique with keyword MONARCHY and encrypt the
message “NETWORK SECURITY”.
7. One-time pad.

2. DES & AES

8. With a neat diagram explain the DES Algorithm.
9. With a neat diagram explain encryption process in DES.
10. Explain various types of passive and active attack. Bring out the differences between
cryptanalytic attack and brute force attack.
11. With a neat diagram explain encryption process in AES.
12. With a neat diagram explain encryption process in DES with details of single round.
Discuss the strength of DES algorithm.
13. Explain in detail, what happens in each round of DES and S-box.
14. Explain the avalanche effect and strength of DES.

3. Public Key Cryptography

15. What is an Avalanche effect?
16. Describe the principles of Public Key Cryptosystems, requirements and applications
of Public-Key Cryptography.
17. Describe RSA algorithm. Perform encryption and decryption using RSA for values: p
= 3, q = 11, e = 7, m = 5.
18. Describe RSA algorithm. Perform encryption and decryption using RSA for values: p
= 7, q = 11, e = 17, m = 8.
19. RSA: In a public key system using RSA you intercept the cipher text C = 10 whose
public key is e = 5, N = 35. What is the plaintext M?
20. Define public key cryptosystems which provide: (i) Confidentiality (ii) Authentication
(iii) Both.
21. What is a primitive root of a number? Using Fermat’s theorem find 30^r mod 11.
 22. State and prove Fermat’s theorem.
23. What is Fermat’s theorem? Explain a method for testing primality of a number.
24. What is Euler's totient function? Prove that if p is prime, then φ(p) = p − 1. And find
φ(35).

4. Diffie-Hellman & ECC

25. Explain Diffie-Hellman key exchange algorithm.
26. Explain Diffie-Hellman key exchange protocol.
27. Explain Diffie-Hellman key exchange algorithm: Given q = 71, a = 7, XA = 5, XB =
12. Find YA, YB, and shared secret key.
28. Using DHKE, find the secret key between users A and B, if P = 71, primitive root =
7, A’s private key = 5, B’s private key = 12.
29. Alice and Bob choose 39869 as a prime number and a = 5. Alice selects XA = 1000,
Bob selects XB = 87. What is the private key shared (DH algorithm)?
30. Describe Elliptic Curve Cryptography and justify how ECC is applicable in public
key cryptanalysis.

5. Hashing, MAC & HMAC

31. Explain with diagrams, message authentication using Hash functions.
32. Describe HMAC.
33. Explain with diagrams message authentication using MAC function.
34. Explain message digest generation using SHA-512 and discuss how single 1024-bit
block is processed with neat diagrams.
35. Explain SHA-512 algorithm and discuss how single 1024-bit block is processed with
neat diagrams.

6. Key Distribution & Kerberos

36. Describe Key Distribution Scenario with a neat diagram.
37. Explain Hierarchical Key Control and Decentralized Key Control Schemes.
38. Describe Key Distribution of session keys using KDC with a neat diagram.
39. What problem was Kerberos designed to address? Explain the overview of Kerberos
with a neat diagram.
40. Explain with diagram the following key distribution techniques of cryptographic
systems:
i) Key distribution using KDC
ii) Decentralized distribution.
41. Explain Kerberos key management system.
7. SSL & Security Protocols
42. With a neat diagram, explain the various operations of SSL Record Protocol.
43. Describe the different phases of Handshake Protocol.
44. Explain SSL Protocol stack and two types of services provided by SSL connections.
45. Describe SSL architecture with neat diagram.
46. Explain SSL Record Protocol.

8. PGP, MIME & S/MIME

47. Describe Pretty Good Privacy Algorithm.
48. Explain Pretty Good Privacy Protocol.
49. Explain the problems addressed by MIME and describe MIME specifications.
50. Explain S/MIME Functionalities.
51. Explain the functionality of S/MIME.

9. Threats, Attacks & Security

52. Define: i) Threat ii) Attack.
53. Explain various types of passive and active attack.
54. Bring out the differences between cryptanalytic attack and brute force attack.
55. Explain various security mechanisms.
56. Define and differentiate between an attack and a threat. Discuss different types of
attacks and services in detail.
57. Explain various types of Viruses and its related threats.
58. What is a malicious software? Explain the various types of Viruses and its related
threats.
59. Explain the techniques used for password guessing. Discuss the two approaches of
Intrusion Detection Techniques.
60. Explain Intrusion Detection Techniques.
61. Discuss WEP attacks and decryption script.
62. Firewalls.
63. Briefly explain the basic types of firewalls. State the advantages and disadvantages of
using firewalls.

10. Digital Signatures & Authentication

64. What is a digital signature? Explain the two categories of generating digital
signatures.
65. Briefly discuss the authentication requirements.
66. Illustrate with examples, the uses of Message Authentication Code.
67. Describe the general structure of Secure Hash Code.
 68. Explain Public Key Distribution using Public Key Authority.

11. Miscellaneous
69. Explain the principle of working of the rotor machine for encryption. How does it
ensure better security?
70. What is Steganography? Explain any one technique of steganography.
71. Describe IP security Architecture.
72. Describe Chinese Remainder Theorem.