CIA = Confidentiality, Integrity, Availability; + Authentication, Non-repudiation · Model = sender → transform → channel → transform → receiver; key from trusted third party; opponent on the channel · 4 tasks: algorithm, secret info, distribution, protocol · Cryptology = cryptography + cryptanalysis · X.800 = attacks + services + mechanisms · Passive: contents, traffic analysis — prevent · Active: masquerade, replay, modification, DoS — detect & recover · Services: authentication, access control, confidentiality, integrity, non-repudiation · Mechanisms: specific (encipherment, signature, notarization…) and pervasive (audit trail, labels…)
6 important questions
- Define the CIA triad.
- Explain the security goals with one threat and one mechanism each.
- Draw and explain the model for network security. What are its four basic tasks?
- Differentiate passive and active attacks.
- Explain the X.800 security services.
- Explain the OSI security architecture (X.800) with security attacks, services and mechanisms.
12 previous-year questions
2025
Illustrate the model for network security and explain each of its components.
2024
Discuss the network security model with a neat diagram.
2025
With help of diagram explain a model for network security.
2024
Define CIA Triad.
2018
Consider an ATM in which users provide a PIN and a card. Give examples of confidentiality, integrity and availability requirements.
2020
Discuss real-life examples where confidentiality, integrity and non-repudiation are needed, and suggest mechanisms.
2024
Differentiate active attacks and passive attacks.
2022
Explain all types of active and passive attacks with example.
2021
What is meant by Denial of Service attack? Is it an active or passive attack?
2025
Summarize the security services defined in X.800.
2024
Explain the types of cryptographic attacks and security services specified by ITU-T X.800 with examples.
2021
Distinguish between security attack, security mechanism and security service.
A=0 … Z=25, everything mod 26 · Additive C = P + k (25 keys) · multiplicative C = P·k (12 keys) · affine C = aP + b (312 keys) · Monoalphabetic: 26! keys, broken by frequency analysis · Inverses mod 26: 3↔9, 5↔21, 7↔15, 11↔19, 17↔23, 25↔25 · 5×5 square: keyword (no repeats) + rest of alphabet, I/J together · Pairs; double letter → X; odd end → X · Row → right · column → down · rectangle → own row, other column · INSTRUMENTS / MONARCHY → GATLMZCLRQXA · Hill: C = KP mod 26; K⁻¹ = det⁻¹·adj mod 26; det must be coprime to 26 · HELP + [[3,3],[2,5]] → HIAT; K⁻¹ = [[15,17],[20,9]] · Vigenère: Cᵢ = Pᵢ + Kᵢ mod 26 (polyalphabetic); EXPLANATION / LEG → PBVWETLXOZR · One-time pad = random key, message length, used once → perfect secrecy; key distribution is the problem · Rail fence: zigzag, read rail by rail · columnar: read columns in key order · Transposition keeps frequencies; substitution changes them · Attack models: ciphertext-only < known-plaintext < chosen-plaintext / chosen-ciphertext < chosen-text · Steganography hides existence (LSB, invisible ink); encrypt then hide
12 important questions
- Decrypt "YMJ" (Caesar, k = 5).
- Explain the affine cipher and find its key space.
- Explain monoalphabetic substitution ciphers with examples. How are they broken?
- Why does Playfair insert X between repeated letters?
- State the Playfair rules and the drawbacks of Playfair.
- Encrypt a given message with Playfair (e.g. "SWARAJ IS MY BIRTH RIGHT", key MONARCHY) and explain each step.
- Why is the one-time pad unbreakable, and why is it not used widely?
- Encrypt "EXPLANATION" with the Vigenère key "LEG".
- Explain the Hill cipher. Encrypt "HELP" with K = [[3,3],[2,5]] and show decryption.
- Differentiate steganography and cryptography.
- Compare substitution and transposition techniques.
- Explain the types of cryptanalytic attacks and the brute-force attack.
31 previous-year questions
2024
Apply Caesar cipher with k = 5 and decrypt "YMJTYMJWXNIJTKXNQJSHJ".
2020
What is a monoalphabetic cipher? How does it differ from the Caesar cipher? Encrypt "this is an exercise" using the additive cipher with key 20 and decrypt it.
2019
Encrypt "This is an exercise" using (i) additive cipher with key 20 (ii) multiplicative cipher with key 15.
2018
How many one-to-one affine Caesar ciphers are there for 26 alphabets?
2022
How much key space is available when a monoalphabetic substitution cipher is used?
2024
Apply the Vigenère cipher and encrypt "explanation" using the key "leg".
2020
Encrypt "tobeornottobe" using the Vigenère cipher with key "NOW".
2022
Differentiate between monoalphabetic and polyalphabetic ciphers with an example of each.
2017
Discuss any two problems with the one-time pad.
2023
List and explain the various substitution cipher techniques with suitable examples.
2024
Demonstrate the process of classical cryptosystems and its types.
2026
Explain classical encryption techniques: substitution and transposition ciphers with examples.
2025
Write the role of classical encryption techniques to secure data, with steps.
2025
Encrypt "SRISAIRAMINSTITUTIONS" using Playfair with keyword MONARCHY.
2025
Construct a 5×5 key matrix for the keyword "communication" using the Playfair method.
2022
Using Playfair, encrypt "BTECH FIFTH SEMESTER" with key "CRYPTOGRAPHY".
2022
What are the drawbacks of a Playfair cipher?
2021
Encrypt "SWARAJ IS MY BIRTH RIGHT" with keyword MONARCHY.
2024
Illustrate the Hill cipher and encrypt "PAY" with the 3×3 key [[17,17,5],[21,18,21],[2,2,19]]; show decryption.
2021
Demonstrate encryption and decryption in the Hill cipher for m = "sh" and key = "hill".
2017
The Hill cipher uses key K11 = 3, K12 = 2, K21 = 5, K22 = 7. Obtain the decryption key.
2025
Apply the rail fence technique to "Savethekingfromattack" with n = 3.
2024
Apply column and row transposition to "attack postponed until two am" (key 3 4 2 1 5 6 7); find the decryption keys.
2023
Explain any two transposition techniques with an example each.
2021
Convert "CRYPTOGRAPHY" into ciphertext using the rail fence technique.
2024
Define steganography with example.
2024
What is steganography? Briefly examine any three techniques.
2022
How is steganography different from cryptography?
2024
Explain cryptanalysis.
2021
Describe a brute-force search and its cryptographic relevance.
2018
Differentiate between chosen-ciphertext and chosen-plaintext attacks.
a mod n ∈ {0 … n−1}; for negatives add n · Euclid: gcd(a, b) = gcd(b, a mod b) · Inverse exists iff gcd = 1; extended Euclid: t = t1 − q·t2 · gcd(1970,1066)=2 · 550⁻¹ mod 1759 = 355 · 1234⁻¹ mod 4321 = 3239 · φ(p) = p−1 · φ(pq) = (p−1)(q−1) · φ(300) = 80 · φ(35) = 24 · Fermat aᵖ⁻¹ ≡ 1 (mod p) · Euler a^φ(n) ≡ 1 (mod n) · aᵏ mod p → reduce k mod (p−1) first; 2¹⁰⁰ mod 7 = 2 · Primitive root test: g^((p−1)/q) ≠ 1 for every prime q | p−1; count = φ(p−1) · Roots: 11 → 2,6,7,8 · 13 → 2,6,7,11 · 23 → 5,7,… · CRT: M = ∏mᵢ, Mᵢ = M/mᵢ, yᵢ = Mᵢ⁻¹ mod mᵢ, x = Σaᵢ Mᵢ yᵢ mod M · (2,3,2) mod (3,5,7) → 23 · (1,2,3,4) mod (5,7,9,11) → 1731 · Miller–Rabin: n−1 = 2ᵏq; a^q; square ≤ k−1 times; n−1 seen → probably prime · 61 → probably prime · 341, 561 → composite · Group = CAIN; abelian = + commutative · Ring = 2 ops, distributive · Field = ring + inverses (non-zero) · Finite field size = pⁿ; GF(p) = Zₚ; Z₆ is not a field · GF(2ⁿ): add = XOR, multiply then reduce by irreducible poly; AES: x⁸+x⁴+x³+x+1 · (x³+x²+x+1)(x³+1) mod (x⁴+x³+1) = x³ + x
12 important questions
- When does a multiplicative inverse mod n exist?
- Find 550⁻¹ mod 1759 using the extended Euclidean algorithm.
- Explain Euclid’s and the extended Euclidean algorithm with examples and their use in cryptography.
- State Fermat’s little theorem with an example.
- Define Euler’s totient and prove φ(pq) = (p − 1)(q − 1).
- State and prove Fermat’s and Euler’s theorems and show their role in RSA.
- Why must the CRT moduli be pairwise coprime?
- Solve x ≡ 2 (mod 3), x ≡ 3 (mod 5), x ≡ 2 (mod 7).
- Explain Miller–Rabin with pseudocode and test 61 and 341.
- Is ⟨Z₆, +, ×⟩ a field? Why?
- Define group, ring and field with one example each.
- Explain finite fields GF(p) and GF(2ⁿ) and their use in cryptography.
32 previous-year questions
2025
Use the extended Euclidean algorithm to find the multiplicative inverse of 1234 mod 4321.
2023
Find gcd(1970, 1066) using Euclid’s algorithm.
2022
Explain Euclidean algorithm. Using it, determine gcd(24140, 16762).
2022
Apply the extended Euclidean algorithm on GCD(171, 13).
2019
Find (i) 70⁻¹ mod 101 (ii) 16⁻¹ mod 323.
2025
Find −18 mod 14.
2021
Find the residues of 6 when n = 8.
2020
Result of −16 mod 13 = ____.
2023
Calculate 2¹⁰⁰ mod 7.
2025
Find 6¹⁰ mod 11.
2018
Calculate the last two digits of 17¹⁶.
2024
State and prove Fermat’s theorem. Find a between 0 and 72 with a⁹⁷⁹⁴ ≡ 4 (mod 73).
2022
Define Euler’s totient function. Prove that φ(pq) = (p−1)(q−1).
2023
Define and discuss the Euler totient function. Why is it important in cryptography?
2025
Find the value of φ(10).
2017
State and prove Euler’s theorem. Compute φ(300).
2024
Find all primitive roots of 13.
2021
Find all the primitive roots of 11.
2025
Show that 5 is a primitive root of 23.
2024
State the CRT and find X for X ≡ 2 mod 3, X ≡ 3 mod 5, X ≡ 2 mod 7.
2022
Find X using CRT: X ≡ 1 mod 5, X ≡ 2 mod 7, X ≡ 3 mod 9, X ≡ 4 mod 11.
2021
Coins shared among 3 friends leave 2, among 5 leave 3, among 7 leave 2. Smallest number of coins? (Use CRT.)
2025
State and prove the Chinese Remainder Theorem with its application in cryptography.
2022
Write the pseudo-code for Miller–Rabin. Test whether 61 is prime.
2021
Explain Miller–Rabin using base 2 to test whether 341 is composite.
2024
Write the pseudocode for Miller–Rabin primality testing.
2024
Write short notes on groups, rings, fields and finite fields.
2025
Utilize groups, rings and fields to explain their importance in cryptographic algorithms.
2021
Multiply x³ + x² + x + 1 by x³ + 1 using x⁴ + x³ + 1 as modulus.
2019
Construct GF(2⁴) using the primitive polynomial x⁴ + x + 1.
2022
Define a group and a ring. Prove that the order of a subgroup of a finite group divides the order of the group.
2025
Differentiate between GF(p) and GF(2ⁿ). Explain how finite fields are constructed.
Stream = bit/byte XOR keystream; block = 64/128-bit blocks + mode · Confusion = substitution (key ↔ C); diffusion = permutation (P spread) · Feistel: Lᵢ = Rᵢ₋₁, Rᵢ = Lᵢ₋₁ ⊕ F(Rᵢ₋₁, Kᵢ); decrypt = keys reversed · Avalanche: 1 bit in → ~half bits out change; AES is not Feistel · DES: 64-bit block, 56-bit key, 16 rounds, 48-bit subkeys · IP → 16 Feistel rounds → swap → IP⁻¹ · F = E (32→48) · ⊕K · 8 S-boxes (6→4) · P (32) · S-box: row = bits 1&6, column = bits 2–5; S1(011011) = 0101 · S-boxes = only non-linear part; resist differential cryptanalysis · PC-1 64→56 · C/D 28+28 · shift 1 (rounds 1,2,9,16) or 2 · PC-2 56→48 · Decryption = same structure, keys K16…K1 (X ⊕ F ⊕ F = X) · Weak 4 · semi-weak 12 · possibly weak 48 · E(K̄, P̄) = C̄ → brute force 2⁵⁵ · Attacks: brute force (1998), differential 2⁴⁷, linear 2⁴³ · 2DES: MITM → ~2⁵⁷ work, not 2¹¹² · 3DES EDE: C = E_K3(D_K2(E_K1(P))); 2-key 112, 3-key 168 · EDE so equal keys = single DES (compatibility) · S-DES: 8-bit block, 10-bit key, 2 rounds, K1/K2
12 important questions
- Define confusion and diffusion.
- Explain the Feistel cipher structure.
- Explain the Feistel structure and prove that its decryption reverses encryption.
- Why does DES need the expansion permutation?
- Explain the DES round function with a diagram.
- Explain DES encryption with a neat diagram.
- What is a weak key in DES?
- Explain the DES key generation process.
- Show that DES decryption is the inverse of encryption and discuss the strength of DES.
- Why is Triple DES used in EDE mode?
- Explain the meet-in-the-middle attack on Double DES.
- Explain Double DES and Triple DES with diagrams and compare their security with DES.
23 previous-year questions
2025
Describe the principle of differential cryptanalysis.
2024
Write about the importance of linear and differential cryptanalysis.
2020
Draw and discuss the structure of a single Feistel round. Does AES follow the Feistel structure?
2026
Explain the Feistel structure in modern block ciphers.
2026
Discuss Shannon’s concepts of confusion and diffusion with examples from DES.
2023
Define avalanche effect.
2025
Interpret the block cipher design principles.
2021
Differentiate between a block cipher and a stream cipher.
2023
Describe the differences between block and stream ciphers with examples.
2025
Explain the working of the DES algorithm, including its key structure and encryption process.
2024
Discuss the working of DES in detail with suitable diagram.
2021
Draw the functionality diagram of one DES round with the number of bits in each flow of data.
2022
What is the most security-critical component of the DES round function? Describe it.
2024
Why does the DES function need an expansion permutation?
2020
A standard DES implementation accepts ___ bits of plaintext, ___ bits of key, and has ___ rounds.
2022
Show that DES decryption is, in fact, the inverse of DES encryption.
2019
Highlight the difference between a strong key, weak key, semi-weak key and possible weak key.
2017
Prove that in DES, if the plaintext block and the key are complemented bitwise, the ciphertext is the bitwise complement of the original ciphertext.
2019
Discuss how chosen-plaintext and known-plaintext attacks are possible in DES.
2024
Give the strengths of Triple DES.
2026
Explain the working of Triple DES with a diagram. Compare it with DES in terms of security.
2025
Explain in detail about DES and Triple DES.
2025
Examine the encryption and decryption processes of Simplified DES (S-DES) in detail, illustrating the results at each step.
AES block 128; keys 128/192/256 → rounds 10/12/14 · Round = SubBytes, ShiftRows, MixColumns, AddRoundKey · Start: AddRoundKey · last round: no MixColumns · Not Feistel; decryption uses inverse transforms · SubBytes: GF(2⁸) inverse + affine (63); S(53)=ED, S(00)=63 · ShiftRows: row r left by r · MixColumns: [02 03 01 01] matrix; ×02 = shift ⊕ 1B; [db,13,53,45] → [8e,4d,a1,bc] · AddRoundKey: XOR — only key step · Values change: Sub, Mix, Add; positions change: Shift · AES-128: 44 words, 11 round keys; 192: 52; 256: 60 · i mod 4 = 0: w[i] = w[i−4] ⊕ SubWord(RotWord(w[i−1])) ⊕ Rcon · Rcon: 01 02 04 08 10 20 40 80 1B 36 · DES 64/56/16 Feistel vs AES 128/128-256/10-14 SPN
9 important questions
- Which AES transformation is skipped in the last round, and why?
- Describe the overall structure of AES.
- Explain AES encryption and decryption in detail with a diagram.
- How is the AES S-box constructed?
- Explain the MixColumns transformation with an example.
- Explain the four AES transformations with examples and compare the AES and DES S-boxes.
- What is Rcon in AES key expansion?
- Compare DES and AES.
- Explain AES key expansion with a diagram and compare DES and AES.
13 previous-year questions
2023
What do you mean by AES? Diagrammatically illustrate the structure of AES and describe the encryption steps with example.
2020
List all the transformations in a typical AES round with a brief description. Which one is skipped in the last round?
2025
What are the four main stages in each round of AES?
2024
List the evaluation criteria defined by NIST for AES.
2021
Explain with sample data the four transformations in AES.
2024
Which of the transformations of AES change the content of bytes and which do not?
2022
Discuss the design of the S-box of AES. How does it differ from the S-boxes of DES?
2024
Explain AES encryption and decryption in detail. Compare the substitution method in DES and AES.
2021
Explain the AES-192 round key generation process with a neat diagram.
2024
Elaborate the key expansion process of AES with a neat diagram.
2025
Differentiate between AES and DES with suitable points.
2022
For each element of DES (XOR of subkey with F input, F function, permutation P, swapping halves), give the comparable element in AES or say why it is not needed.
2019
AES has a larger block size than DES. Is this an advantage or disadvantage? Discuss brute force on AES.
ECB leaks patterns · CBC: Cᵢ = E(Pᵢ ⊕ Cᵢ₋₁), IV · CFB/OFB/CTR: XOR with E-output → only E needed, no padding · CTR: parallel, random access, precompute; counter never repeats · Error: OFB/CTR 1 bit · CBC Pᵢ + 1 bit of Pᵢ₊₁ · CFB a few blocks · Stream: Cᵢ = Pᵢ ⊕ kᵢ; never reuse key stream · RC4 KSA: j = j + S[i] + T[i], swap · PRGA: i++, j += S[i], swap, k = S[S[i]+S[j]] · RC4 weaknesses: biased early bytes, WEP break, banned in TLS · TRNG (physical) vs PRNG (seeded, must be unpredictable)
6 important questions
- State two advantages of CTR mode.
- Why is ECB insecure? Explain CBC as the fix.
- Explain the five block cipher modes with diagrams and compare them.
- Why must a stream cipher never reuse a key stream?
- Explain RC4 with pseudocode.
- Explain stream ciphers and RC4 in detail with a diagram and an example.
11 previous-year questions
2024
Define block cipher. Discuss any two modes of operation with advantages, disadvantages and block diagrams.
2021
Explain the block modes of operation and why ECB is not a secure mode; highlight its problems.
2021
Discuss and differentiate between CBC and CFB modes.
2020
Compare CFB and CTR on parallel processing, preprocessing, error propagation and use as a stream cipher.
2019
Why is a random IV used in CBC? What goes wrong with a fixed IV?
2024
State the advantages of counter mode.
2017
Some modes use only encryption while others use both. Why?
2025
Analyze the RC4 stream cipher in detail: working mechanism, pseudocode and diagram.
2022
Discuss the stream cipher RC4 in detail.
2024
Explain the RC4 cipher along with pseudocode.
2021
Explain the bitwise XOR operation involved in RC4.
8 attacks: disclosure, traffic analysis | masquerade, content, sequence, timing | source rep. | destination rep. · Privacy (1–2) · authentication (3–6) · signature (7) · signature + protocol (8) · Authenticators: message encryption, MAC, hash · E(K,M): conf + auth · E(PRa,M): auth + sign · E(PUb,E(PRa,M)): all · MAC = C(K, M), appended; receiver recomputes and compares · (a) M‖C(K,M) · (b) E(K2, M‖C(K1,M)) · (c) E(K2,M)‖C(K1,E(K2,M)) · 2^(k−n) keys match one pair; effort min(2ᵏ, 2ⁿ) · Requirements: no forgery, uniform 2⁻ⁿ, transformations don’t help · MAC: integrity + auth, no non-repudiation · HMAC = H[(K⁺⊕opad) ‖ H[(K⁺⊕ipad) ‖ M]]; ipad 36, opad 5C · HMAC objectives: reuse hash, swap hash, keep speed, simple keys, provable · CMAC: CBC with IV 0; last block ⊕ K1 (full) or K2 (padded) · K1 = L·x, K2 = L·x², L = E(K, 0)
9 important questions
- List the requirements for message authentication.
- What are the three classes of authentication functions?
- Explain message encryption as an authentication function with diagrams.
- Differentiate MAC and hash function.
- Explain the requirements of a MAC function.
- Explain MAC with its three uses (diagrams), brute-force analysis and requirements.
- Define CMAC.
- List the design objectives of HMAC and write its formula.
- Explain HMAC and CMAC with diagrams.
16 previous-year questions
2022
Define message authentication. What two levels of functionality comprise a message authentication or digital signature mechanism? What approaches produce message authentication?
2024
Classify the attacks that are addressed by message authentication.
2025
Explain the three classes of authentication functions.
2023
List the authentication message requirements.
2024
Explain message encryption using symmetric and public key techniques in detail.
2024
Discuss the message authentication code (MAC). Also give the use of authentication requirements in MAC.
2023
Explain how message authentication is performed by MAC with neat diagrams.
2021
Differentiate between a hash code and a message authentication code (MAC).
2020
Are MDC and MAC the same? Justify. Brief the requirements of a hash function.
2024
List the uses of MAC.
2025
Summarize three classes of MAC.
2023
Write short notes on (a) HMAC (b) CMAC.
2024
Discuss HMAC and CMAC in detail.
2022
List and briefly describe the design objectives for HMAC.
2024
Discuss the objectives of HMAC and its security.
2022
Define CMAC.
Uses: (a) E(K,M‖H) (b) M‖E(K,H) (c) M‖H(M‖S) (d) E(K,M‖H(M‖S)) · One-way · weak collision (x given) · strong collision (any pair) · Effort: 2ⁿ · 2ⁿ · 2^(n/2) · Rotate-XOR hash of 10 2F 1B 08 = 02 — not one-way · Predefined 0.69N (253) · chosen member 0.69N+1 (254) · any pair 1.18√N (23) · two sets 0.83√N (16) · P3 = 1 − e^(−k(k−1)/2N) (slide misses the minus) · n-bit hash collision ≈ 2^(n/2) → need n ≥ 256 · Yuval: 2^(n/2) good + bad variants → matching hash → reuse signature
6 important questions
- Define weak collision resistance.
- List the requirements of a cryptographic hash function.
- Explain the different ways a hash code can be used for message authentication, with diagrams.
- What is the birthday paradox?
- Explain the birthday attack on hash functions.
- Explain the four birthday problems and their significance for hash functions.
10 previous-year questions
2021
Differentiate weak, strong and complete collision resistance. Is the birthday paradox helpful in providing a strong hash?
2022
What are the requirements of a good hash function?
2024
Define pre-image resistance and second pre-image resistance.
2024
What is meant by the one-way property in a hash function?
2025
Explain the nature of brute-force attacks for hash functions and MACs.
2022
In what ways can a hash value be secured to provide message authentication?
2024
Explain birthday attack.
2026
What is a hash function? Explain the birthday attack with an example.
2020
State the birthday problem.
2025
What is a birthday attack?
SHA-512: block 1024, word 64, 80 rounds, digest 512, message < 2¹²⁸ · Pad 1 then 0s to 896 mod 1024 (1–1024 bits); + 128-bit length · Buffers a–h: sqrt of first 8 primes; a = 6A09E667F3BCC908 · Hᵢ = Hᵢ₋₁ + F(…) word-wise mod 2⁶⁴; MD = H_N · L = 1500 → 420 pad bits, 2 blocks · W0–W15 from block; Wₜ = σ1(Wₜ₋₂) + Wₜ₋₇ + σ0(Wₜ₋₁₅) + Wₜ₋₁₆ · σ0 = ROTR1 ⊕ ROTR8 ⊕ SHR7 · σ1 = ROTR19 ⊕ ROTR61 ⊕ SHR6 · SHR = right shift (slide error says left) · Kₜ = cube roots of first 80 primes; K0 = 428A2F98D728AE22 · T1 = h + Ch(e,f,g) + Σ1(e) + Wt + Kt; T2 = Σ0(a) + Maj(a,b,c) · a = T1+T2, e = d+T1, others shift down · Ch = (e∧f)⊕(¬e∧g); Maj = (a∧b)⊕(a∧c)⊕(b∧c) · Σ0: 28,34,39 · Σ1: 14,18,41 · MD5 128/64 steps · SHA-1 160/80 · both broken
9 important questions
- Why does SHA-512 pad the message to 896 mod 1024?
- Explain the steps of SHA-512.
- Explain SHA-512 with block diagrams.
- How are the constants Kₜ of SHA-512 obtained?
- Explain how SHA-512 derives 80 words from a 1024-bit block; give W16–W19.
- Explain the processing of a single 1024-bit block in SHA-512.
- Define the Ch and Maj functions of SHA-512.
- Compare MD5, SHA-1 and SHA-512.
- Explain the SHA-512 round function with a diagram.
12 previous-year questions
2024
Explain hash functions. Discuss SHA-512 with all required steps, round function and block diagram.
2022
Explain the SHA-512 algorithm in detail.
2024
Explain the processes involved in the SHA algorithm for maintaining integrity.
2021
Write the steps involved in the generation of a message digest.
2024
Illustrate deriving eighty 64-bit words from 1024 bits for a single block and discuss the single round function in SHA-512. Show the values of W16, W17, W18 and W19.
2025
Illustrate SHA-1: how a 512-bit block becomes a 160-bit digest — padding, block processing, output.
2022
Illustrate the working of SHA-1 with a diagram.
2021
What is SHA-1? What arithmetic and logical functions are used in SHA?
2026
Explain SHA-1 and discuss its security limitations.
2025
Differentiate between MD5 and SHA-1.
2022
Explain the MD-5 algorithm in detail.
2020
Explain the steps of message digest generation in Whirlpool with a block diagram.
Ingredients: P, E, PU/PR, C, D · Confidentiality: E(PU_receiver) · Signature: E(PR_sender) · Requirement: PR not derivable from PU (trapdoor one-way) · Hybrid: public key moves the session key; symmetric encrypts data · n = pq, φ = (p−1)(q−1), gcd(e, φ) = 1, d = e⁻¹ mod φ · C = Mᵉ mod n; M = Cᵈ mod n · 3,11,7,5 → n 33, d 3, C 14 · 17,11,7,88 → n 187, d 23, C 11 · Trapdoor = d (or p, q); security = factoring · Square-and-multiply; reduce mod n every step · 88⁷ mod 187 = 11 (88²→77, 88⁴→132) · C=8,e=13,n=33 → d 17, M 2 · C=20,e=13,n=77 → d 37, M 48 · e=65, n=2881 = 43×67 → d = 725 · F-C-E-D-P-M-I taxonomy · Chosen ciphertext: Y = C·Xᵉ → Z = P·X → P = Z·X⁻¹ · Broadcast e = 3 + CRT → P³ → cube root · Leaked d → factor n → new n required · Common modulus → members factor n · timing/power → constant time
12 important questions
- List the ingredients of a public-key cryptosystem.
- Differentiate symmetric and asymmetric cryptography.
- Explain public-key cryptography with diagrams for confidentiality and authentication.
- Find d for RSA with p = 3, q = 11, e = 7.
- Explain RSA key generation, encryption and decryption.
- Explain the RSA algorithm and perform it for p = 17, q = 11, e = 7, M = 88.
- Compute 5⁷ mod 33 quickly.
- Intercept C = 20, e = 13, n = 77; find M.
- Explain fast modular exponentiation and use RSA for p = 17, q = 11, e = 7, M = 88.
- Why is a common modulus dangerous in RSA?
- Explain the chosen-ciphertext attack on RSA.
- Explain the possible attacks on RSA with countermeasures.
20 previous-year questions
2024
Differentiate symmetric cryptography from asymmetric key cryptography.
2024
Explain in detail about public key cryptography and its components with a suitable block diagram.
2021
Describe public key cryptography. What is the role of the session key in public key schemes?
2023
Explain asymmetric key cryptography in a short note.
2025
Explain the components of an encryption algorithm: plaintext, encryption algorithm, secret key, ciphertext, decryption algorithm.
2025
Perform encryption and decryption using RSA with p = 3, q = 11, e = 7, M = 5.
2025
Write RSA algorithm. Encrypt and decrypt for p = 7, q = 11, e = 13, M = 5.
2023
Estimate encryption and decryption for P = 7, Q = 11, E = 17, M = 8.
2022
Define a one-way function, and perform RSA for p = 11, q = 13, e = 11, M = 7.
2020
State RSA encryption and decryption as a trap-door one-way function. Explain RSA key generation.
2022
In a public key system using RSA, you intercept C = 8 sent to a user whose public key is e = 13, n = 33. What is M?
2021
You intercept C = 20 with e = 13, n = 77. What is M? The public key of a user is e = 65, n = 2881 — find the private key.
2021
Alice chooses 173 and 149 as primes and 3 as public key. Check whether they are valid.
2020
For p = 11, q = 19 and d = 17, apply RSA to the cipher message 80 and find the plaintext.
2021
Alice and Bob use RSA with p = 13, q = 17, e = 7: find d and encrypt "CRYPTOGRAPHY" using 00–25.
2025
Identify the possible threats for the RSA algorithm and list their countermeasures.
2024
Explain the implementation of RSA and its attacks in detail.
2018
Bob leaks his private key. Instead of a new modulus he generates a new public and private key. Is this safe?
2019
An adversary changes one bit of e in Bob’s public key email; Alice encrypts m twice. How can the adversary recover m?
2021
If a plaintext block shares a common factor with n, does it help recover the plaintext without the private key?
Cyclic: Zₙ* = {g¹…g^φ(n)}; Z₁₀* roots 3, 7 · Zₚ* always cyclic · x = L_g(y) if y = gˣ mod p; unique mod p − 1 · Z₇*: L₃(4) = 4, L₅(6) = 3 · DLP hardness → DH, ElGamal, DSS · e₂ = e₁ᵈ mod p · public (e₁, e₂, p) · private d · C₁ = e₁ʳ, C₂ = P·e₂ʳ (mod p) · P = C₂·(C₁ᵈ)⁻¹ = C₂·C₁^(p−1−d) mod p · (11, 2, d 3, r 4, P 7) → (5, 6) · y² = x³ + ax + b mod p; 4a³ + 27b² ≠ 0 · Add λ = Δy/Δx · double λ = (3x²+a)/(2y) · x₃ = λ² − x₁ − x₂; y₃ = λ(x₁ − x₃) − y₁ · E₂₃(1,1): (18,20)+(6,4) = (11,20); 2(18,20) = (12,19) · ECDH K = nA·nB·G; 256-bit ECC ≈ 3072-bit RSA
9 important questions
- What is the discrete logarithm problem?
- Explain cyclic groups and discrete logarithms with Z₇*.
- Explain the discrete logarithm problem and its use in public-key cryptography.
- Why is ElGamal called randomised encryption?
- Encrypt P = 7 with ElGamal (p = 11, e₁ = 2, d = 3, r = 4) and decrypt.
- Explain the ElGamal cryptosystem with a diagram and example.
- What is the main advantage of ECC over RSA?
- Explain ECC Diffie–Hellman key exchange.
- Explain elliptic curve cryptography with point addition and encryption/decryption.
9 previous-year questions
2020
Show that 7 is a primitive root of 23.
2017
Find at least two primitive roots of 19.
2026
Discuss the discrete logarithm problem (DLP). Why is it important for public-key cryptography?
2024
Explain the key generation, encryption and decryption in ElGamal.
2024
If P = (18, 20) and Q = (6, 4) are points on E₂₃(1, 1), find P + Q and 2P.
2021
Find at least two points on the elliptic curve y² = x³ + 2x + 3 mod 5.
2022
Give the encryption/decryption procedures using Elliptic Curve Cryptography.
2025
Explain the working principle of ECC encryption and decryption.
2025
What is the main advantage of ECC over RSA?
Sign: sender PRIVATE key · verify: sender PUBLIC key · Differences: inclusion, verification, relationship (1:1), duplicity · Sign the digest h(M) — speed; security then needs a strong hash · Direct (2 parties) vs arbitrated (trusted arbiter) · Services: authentication, integrity, non-repudiation (no confidentiality) · Trusted centre verifies, stores, re-signs → firm non-repudiation · Confidentiality: sign with PRa, then encrypt with PUb · Attacks: key-only, known-message, chosen-message · Forgeries: existential, selective, universal, total break · RSA sign S = Mᵈ, verify Sᵉ ≡ M; Ex 13.1: 19070 → 210625 · ElGamal S₁ = e₁ʳ mod p, S₂ = (M − dS₁)r⁻¹ mod (p−1) · Verify e₁ᴹ ≡ e₂^S₁·S₁^S₂ (mod p) · Small: (11, 2, d 3, r 7, M 5) → (7, 2), V = 10 · Random r → same M gives different signatures · DSS: NIST/NSA, FIPS 186 (1991), SHA, signature only · q | p − 1; e₁ = e₀^((p−1)/q); e₂ = e₁ᵈ mod p · S₁ = (e₁ʳ mod p) mod q; S₂ = (h + dS₁)r⁻¹ mod q · V = (e₁^(h·S₂⁻¹)·e₂^(S₁·S₂⁻¹) mod p) mod q = S₁ · Example (23, 11, e₁ 9, d 8, r 5, h 6) → (8, 3)
12 important questions
- Which keys are used in a digital signature?
- Differentiate conventional and digital signatures.
- Explain the digital signature process with diagrams; state its requirements and compare direct and arbitrated signatures.
- List the services provided by digital signature.
- Explain how non-repudiation is achieved with a trusted centre.
- Explain the services of a digital signature and how confidentiality is added; list attacks on signatures.
- Write the RSA signature and verification equations.
- Explain the ElGamal digital signature scheme.
- Explain the RSA and ElGamal digital signature schemes with diagrams and examples.
- Why are two DSS signatures of the same message different?
- Write the DSA signing and verifying steps.
- Explain the Digital Signature Standard with key generation, signing, verification and an example.
20 previous-year questions
2026
Describe the structure of a digital signature and explain the ElGamal digital signature scheme in detail.
2024
Write about the ElGamal digital signature scheme.
2017
Describe the ElGamal scheme of digital signature generation and verification. Why do signatures of the same message signed on different occasions differ?
2021
Differentiate between direct and arbitrated digital signatures.
2021
What are the requirements for a digital signature? Briefly explain direct and arbitrated digital signatures.
2024
What is a digital signature? Explain how it is created at the sender end and verified at the receiver end; differentiate digital signature from digital certificate.
2017
Compare and contrast a conventional ink-based signature and a digital signature.
2021
Draw the functional diagram of RSA-based digital signature.
2019
Can a digital signature be forged?
2024
Write the services provided by digital signature.
2022
Discuss the various services provided by digital signature.
2025
Explain the attacks related to digital signature.
2021
How does a digital signature differ from authentication protocols?
2025
Relate how a digital signature ensures security.
2021
Explain the RSA algorithm for forming a digital signature with a suitable example.
2022
Write the DSA of the Digital Signature Standard. What is the implication if the same k is used to sign two different messages?
2025
With DSS, if the same message is signed on different occasions the signatures differ. Why?
2025
Apply DSA to show how it protects digital messages; write the steps to create and verify a signature.
2021
Explain the DSS algorithm with a suitable example.
2024
Explain digital signature and discuss the signing and verifying process of DSA.
Pairwise keys n(n−1)/2; KDC needs n · Distribution: physical by A, physical by third party, old key, KDC · Flat vs hierarchical KDCs · Session key = one session only · Simple protocol: E_KA(K_AB, E_KB(…)) → replay flaw · 1 A→KDC: A, B, Rₐ · 2 KDC→A: E_KA(Rₐ, B, K_AB, E_KB(A, K_AB)) · 3 A→B: ticket · 4 B→A: E_KAB(R_B) · 5 A→B: E_KAB(R_B − 1) · Flaw: old K_AB → replay ticket; fix timestamps (Kerberos) · AS (KDC) → TGT; TGS → service ticket; Bob → service · 1 Alice · 2 E_KA-AS(K_A-TGS, TGT) · 3 Bob, E(T), TGT · 4 E_KA-TGS(Bob, K_AB), ticket_B · 5 E_KAB(T), ticket_B · 6 E_KAB(T−1) · Password never sent; timestamps stop replay; single sign-on · New server → repeat last 4 steps · v5: longer lifetime, renewable, any cipher, ASN.1, more overhead · Realm = AS + TGS + users/servers; inter-realm keys · Requirements: secure, reliable, transparent, scalable · Weaknesses: password guessing, replay window, clock sync, single point of failure
12 important questions
- What is a session key?
- Explain the KDC and the hierarchical arrangement of KDCs.
- Explain key distribution using a KDC with a protocol diagram and its weakness.
- Why does Alice send R_B − 1 in Needham–Schroeder?
- Explain the Needham–Schroeder protocol.
- Explain the Needham–Schroeder protocol and its weakness. How does Kerberos overcome it?
- What does the Ticket-Granting Ticket allow in Kerberos?
- Explain the roles of AS, TGS and the real server in Kerberos.
- Explain the working of Kerberos with a neat diagram.
- List the four requirements of Kerberos.
- Differentiate Kerberos version 4 and version 5.
- Explain Kerberos realms and the use of different servers; discuss the limitations of Kerberos.
19 previous-year questions
2020
Define KDC. Discuss a protocol that involves a KDC for the distribution of session keys.
2026
Explain symmetric key distribution techniques. Discuss the KDC method.
2025
Explain the purpose and working of a KDC with a diagram.
2017
List the ways in which secret keys can be distributed to two communicating partners.
2021
Discuss key management approaches and their importance in real-time scenarios.
2025
Explain the Needham–Schroeder protocol using a neat diagram.
2019
Discuss the need for mutual authentication and explain a method to achieve it.
2025
Describe challenge–response authentication mechanisms with a suitable diagram.
2021
Describe client–server mutual authentication with an example flow diagram.
2024
Explain the Kerberos protocol for key distribution with a suitable diagram.
2025
Identify the main components of Kerberos and explain the client–KDC/TGS and client–server exchanges with a diagram.
2024
What is Kerberos? Explain how Kerberos version 4 provides authenticated services.
2021
Describe Kerberos, its requirements and function with an example.
2022
In the context of Kerberos, what is a principal?
2024
In Kerberos, what does the Ticket Granting Ticket (TGT) allow?
2025
Give the difference between Kerberos version 4 and 5.
2025
Rephrase the various attacks on Kerberos and write the four requirements of Kerberos.
2021
Discuss the four requirements of Kerberos.
2017
Client C wants to communicate with server S using Kerberos. How can it be achieved?
R₁ = gˣ, R₂ = gʸ, K = gˣʸ (mod p) · (7, 23, 3, 6) → 21, 4, 18 · (3, 353, 97, 233) → 40, 248, 160 · Security: discrete log; weakness: MITM · 3 parties: two rounds → gᵃᵇᶜ · MITM: Eve shares K₁ = gˣᶻ with Alice and K₂ = gᶻʸ with Bob · Cause: unauthenticated R values · STS: R₁ → R₂ + cert_B + E_K(Sig_B(R₁,R₂)) → cert_A + E_K(Sig_A(R₁,R₂)) · Fix = signatures + certificates (authenticated DH) · Public announcement → trusted centre → controlled trusted centre → CA · X.509: version, serial, sig alg, issuer, validity, subject, subject PK, [IDs, extensions], signature · Revoke: user key compromised, CA stops certifying, CA key compromised · CRL: this/next update, revoked list; delta CRL = changes only · PKI duties: certificates (issue/renew/revoke), key storage/update, services to protocols, access control · Hierarchy: root → CAs → users; X<<Y>> = X signs Y’s cert · Chain: user cert → issuing CA cert → self-signed root · Other models: mesh, web of trust (PGP), browser roots
12 important questions
- What is the shared key in Diffie–Hellman?
- DH with q = 353, α = 3, X_A = 97, X_B = 233.
- Explain the Diffie–Hellman key exchange with an example and discuss its security.
- Why is Diffie–Hellman open to man-in-the-middle?
- Explain the man-in-the-middle attack on Diffie–Hellman.
- Explain the MITM attack on DH and the Station-to-Station protocol that prevents it.
- Give the reasons for revoking an X.509 certificate.
- Explain the X.509 certificate format.
- Explain public-key distribution methods and X.509 certificates, including renewal and revocation.
- What does X<<Y>> mean in PKI?
- List and explain the duties of a PKI.
- Explain PKI and the hierarchical trust model with certificate-chain verification.
21 previous-year questions
2024
List the methods to distribute public keys.
2025
What is public key distribution?
2021
Explain DH. Prime 353, primitive root 3, X_A = 97, X_B = 233: compute the public keys and the common secret key.
2020
In DH, p = 23 and g = 7; Alice’s and Bob’s private keys are 3 and 6. Find the shared key and show 7 is a primitive root of 23.
2025
Find Y_A, Y_B and the shared key for q = 257, α = 3, X_A = 179, X_B = 85.
2025
Users A and B use DH with q = 71, α = 7; private keys 5 and 2. Find Y_A, Y_B and the shared key.
2021
Demonstrate DH with p = 11, g = 2, X_A = 9, X_B = 4. Write the steps for DH between Alice, Bob and Carol.
2023
Explain why cracking Diffie–Hellman key exchange is considered hard.
2017
What is an authenticated Diffie–Hellman key agreement?
2023
"With a quantum computer, a message encrypted with Diffie–Hellman can be cracked." Explain.
2017
Describe how the Diffie–Hellman algorithm is vulnerable to the man-in-the-middle attack. Determine the shared key for prime 71, primitive root 7, private keys 5 and 12.
2024
Discuss X.509 certificates in detail and their role in cryptography.
2024
Give the format of an X.509 certificate. How are user certificates obtained?
2024
Mention the reasons for which a certificate can be revoked in X.509.
2025
What is a digital certificate? What is a chain of certificates? How is an X.509 certificate revoked?
2021
Describe the elements of an X.509 certificate.
2024
State the importance of the certificate authority in X.509.
2025
What is a chain of certificates?
2021
What are the specific components of the Public Key Infrastructure (PKI)?
2020
Explain the PKI management model and its operations with a diagram.
2026
What is PKI? Explain the X.509 certificate structure.
Host: trapdoor, logic bomb, Trojan, virus · independent: worm, zombie · Trapdoor = secret entry · logic bomb = condition-triggered · Trojan = attractive program + hidden effect · zombie = bot for DDoS · Spyware, keylogger, spammer, rootkit · Virus modifies programs to include itself; runs first, then the host · Phases: dormant, propagation, triggering, execution · Types: parasitic, memory-resident, boot sector, stealth, polymorphic (+ macro, metamorphic) · Melissa = Word macro e-mail virus (50 contacts) · Antivirus: signatures, heuristics, activity traps, generic decryption · Worm: self-replicates over the network (e-mail, remote execution, remote login) · Signs: less disk space, slow, missing/new files · Melissa 1999 macro virus, 50 contacts · ILOVEYOU 2000 VBS worm, whole book · Stuxnet 2010 SCADA · Virus (host + user) vs worm (independent) vs Trojan (no replication)
9 important questions
- What is a logic bomb?
- Explain trapdoor, logic bomb, Trojan horse and zombie.
- Classify malicious programs and explain each type.
- What is a polymorphic virus?
- Explain the phases of a virus.
- Explain viruses: structure, phases, types and countermeasures.
- Differentiate a virus and a worm.
- Compare the Melissa and ILOVEYOU attacks.
- Explain worms with examples and the measures to protect against malware.
14 previous-year questions
2022
Describe the terms worms, virus, Trojan and spyware.
2020
Discuss briefly malicious software.
2024
The internal code of software that sets off a malicious function when conditions are met is called ____.
2021
Write short notes on spammers and key loggers.
2024
Explain the different malicious software and suggest measures to overcome them.
2021
Explain all the different phases a virus goes through in its lifetime.
2023
Describe different kinds of viruses and malware.
2025
Write a note on types of viruses.
2021
How do worms and viruses compare? Describe the components of a virus and how it protects itself from antivirus software.
2024
Define generic decryption.
2022
Differentiate between virus and worm.
2026
What is intrusion detection? Explain virus, worm and Trojan with suitable examples.
2021
List the forms of malware attacks. How can you protect your computer from malware?
2017
Write a short note on viruses and related threats.
Firewall = choke point at the gateway enforcing a policy · Goals: all traffic through it, only authorised traffic, itself immune · Functions: filter, log, alarm, authenticate, NAT, VPN, block scanning · Cannot stop: insiders, backdoors, social engineering, password misuse, allowed ports, dial-up · Packet filter: IP, ports, protocol, interface → forward/discard · Slide rules: block 131.34.0.0, Telnet 23 in, host 194.78.20.8, HTTP 80 out · Fast but no content check; IP spoofing · Stateful: directory of outbound TCP connections; allow matching returns only · Application gateway (proxy): authenticates, relays app data, inspects content — overhead · Circuit gateway: two TCP connections, relays without inspection (SOCKS) · Bastion host = hardened gateway system · DMZ: web/mail/DNS between external and internal firewalls · Multi-homed: 3+ interfaces · Intruders: masquerader, misfeasor, clandestine user · IDS: sensors → analysers → admin interface; HIDS vs NIDS · Statistical: threshold, profile · rule-based: anomaly, penetration identification · Firewall blocks by rules · IPS blocks attacks inline · IDS alerts (non-inline) · Overlap → false positives vs false negatives
12 important questions
- State the design goals of a firewall.
- List the functions and limitations of a firewall.
- What is a firewall? Explain its functions, types and limitations.
- What is stateful inspection?
- Explain a packet-filtering firewall with a rule table.
- Explain packet-filtering and stateful inspection firewalls.
- What is a bastion host?
- Differentiate application-level and circuit-level gateways.
- Explain the types of firewalls and the common firewall configurations.
- List the three classes of intruders.
- Differentiate statistical anomaly and rule-based intrusion detection.
- Explain IDS in detail with a diagram and compare firewall, IPS and IDS.
21 previous-year questions
2025
What is a firewall and why is it needed? Differentiate the types briefly and explain the working principle.
2024
Present a complete picture of firewalls: types, configuration issues and limitations.
2024
Indicate the design goals of firewalls.
2024
Explain the firewall and its usage.
2025
Briefly discuss the work flow of a firewall with a suitable diagram.
2022
Explain the importance of a firewall in network security. Compare all the types of firewall.
2025
What does a packet-filtering firewall do?
2021
Discuss technical details of firewalls and describe any three types with neat diagrams.
2025
Make use of the firewall concept to explain the various types of firewalls.
2024
Discuss the different types of firewalls.
2021
Elucidate different types of firewalls and their configuration.
2017
Explain the significance of a firewall and discuss the possible firewall configurations.
2025
List the design goals for a firewall.
2024
How do firewalls complement other security measures against intrusions?
2024
Explain the working of an intrusion detection system and its types.
2023
Explain the Intrusion Detection System in detail with a suitable diagram.
2024
List the three classes of intruders.
2024
Write three benefits of intrusion detection. Elucidate how statistical anomaly detection works.
2021
Why is having an intrusion detection system essential for network security?
2025
What is intrusion? Write the techniques to detect intrusion in a network.
2024
Elaborate audit records in detail.
PGP services: signature, encryption, compression, Radix-64, segmentation · Sign: E(PRa, SHA-1(M)) · encrypt: E(Ks, M) + E(PUb, Ks) · Ks = one-time 128-bit key; CAST-128/IDEA/3DES, 64-bit CFB · Both: sign → compress → encrypt → radix-64 · Sign → compress → encrypt → radix-64 · Radix-64: 24 bits → 4 × 6 bits → chars; A–Z 0–25, a–z 26–51, 0–9 52–61, + 62, / 63, = pad · +33% size, CRC added · "new" encrypted → 36 25 42 8 → kZqI (slide error: m) · Format: session key (E_KUb) · signature (E_KRa) · message; ZIP + E_Ks over sig + msg · Key ID = KU mod 2⁶⁴ · Private ring: timestamp, key ID, PK, E(H(passphrase), KR), user ID · Public ring: + owner trust, certificates, cert trust, key legitimacy · X.509 single path vs PGP many paths (web of trust) · Legitimacy F if a fully trusted certificate (John: P → F after Ted’s cert) · SMTP limits: no binary, 7-bit only, size → MIME · MIME headers: Version, Content-Type, Transfer-Encoding, ID, Description · 7 types: text, multipart, message, image, video, audio, application · S/MIME: enveloped, signed, clear-signed, signed+enveloped · Algorithms: SHA-1, DSS/RSA, DH/RSA, 3DES (AES), HMAC-SHA1
12 important questions
- List the five principal services of PGP.
- How does PGP provide confidentiality?
- Explain PGP cryptographic functions with block diagrams.
- Why does PGP sign before compressing?
- Explain Radix-64 conversion with an example.
- Explain the PGP message format and the order of operations.
- What is a PGP key ID?
- Explain the PGP private and public key rings.
- Explain trust and key legitimacy in PGP with an example, and compare PGP certificates with X.509.
- What is S/MIME?
- Differentiate MIME and S/MIME.
- Explain S/MIME: functionality, cryptographic algorithms and comparison with PGP.
21 previous-year questions
2023
Explain the operational description of PGP and its cryptographic functions with block diagrams.
2024
How does PGP provide authentication and confidentiality for e-mail and file transfer? Draw the block diagram.
2024
List any four services provided by Pretty Good Privacy.
2022
Explain the sequence of steps in message generation and reception in PGP with block diagrams.
2021
List the services supported by PGP and explain how PGP supports them.
2024
Develop a step-by-step overview of transmitting a PGP-encrypted message, including key generation, encryption and digital signatures.
2022
Why is compression done before encryption in PGP?
2017
Explain why PGP generates a signature before applying compression.
2025
Explain the PGP message generation process. Why is the signature generated before compression while encryption is applied after compression?
2018
In PGP, what is the probability that a user with N public keys will have at least one duplicate key ID?
2025
Categorize the key services offered by PGP and illustrate each with examples.
2025
Why is PGP open source? Explain the services provided in PGP.
2025
Apply the difference between PGP and S/MIME in terms of encryption methods, key management and real-world applications.
2021
Explain S/MIME and the difference between S/MIME and PGP.
2021
Explain the process of Radix-64 conversion.
2021
Discuss the seven types of MIME content type.
2024
Explain the cryptographic algorithms used in S/MIME and describe S/MIME certificate processing.
2024
Explain how Secure/Multipurpose Internet Mail Extension is supported in e-mail security with S/MIME messages.
2022
Describe the S/MIME message content types. How is compression achieved in S/MIME?
2017
What are the key algorithms used in S/MIME? What header fields are defined in MIME?
2022
Differentiate between MIME and S/MIME in detail.
Threats: integrity, confidentiality, DoS, authentication · Network = IPSec · transport = SSL/TLS · application = S/MIME, Kerberos · Stack: Handshake | Change Cipher Spec | Alert | HTTP over Record over TCP · Session (Handshake-created, shareable) vs connection (transient, one session) · Session state: ID, peer cert, compression, cipher spec, master secret, resumable · Inputs: client random, server random, pre-master secret · MS = MD5(PM‖SHA1("A"‖PM‖CR‖SR)) ‖ … "BB" ‖ … "CCC" = 48 bytes · Key material: same with MS · Six: client/server MAC secret, client/server write key, client/server IV · Record: fragment (≤2¹⁴), compress, MAC, encrypt, header · Change Cipher Spec = 1 byte (value 1): pending → current · Alert = level + alert (2 bytes); warning or fatal · Fatal: unexpected message, bad record MAC, decompression failure, handshake failure, illegal parameter · Phase I: ClientHello, ServerHello (version, random, session ID, cipher, compression) · Phase II: Certificate, ServerKeyExchange, CertificateRequest, ServerHelloDone · Phase III: Certificate, ClientKeyExchange, CertificateVerify · Phase IV: ChangeCipherSpec + Finished (MD5 + SHA) both sides · TLS: HMAC, PRF, more alerts
12 important questions
- Differentiate an SSL session and an SSL connection.
- Explain the SSL architecture.
- Explain web security approaches and the SSL architecture with session and connection states.
- How long is the SSL master secret and how is it formed?
- Explain how the SSL master secret and key material are generated.
- Explain SSL cryptographic computations with diagrams.
- What does the Change Cipher Spec protocol do?
- Explain the SSL Record Protocol operation.
- Explain the SSL Record, Change Cipher Spec and Alert protocols.
- What does the ClientHello message contain?
- Explain the four phases of the SSL handshake.
- Explain the SSL Handshake Protocol with a diagram showing all messages.
14 previous-year questions
2026
Explain SSL architecture and discuss the importance of digital certificates.
2025
What is the secure socket layer? Discuss it with a suitable diagram.
2025
Elaborate the four protocols used in SSL and the interactions between them.
2020
SSL has four protocols in two layers. The record protocol carries messages from ____, ____ and ____ protocols and application data.
2025
Explain SSL architecture with a suitable diagram and example.
2020
Name the hash algorithms used by SSL to provide message integrity.
2024
Differentiate SSL and TLS protocols.
2020
List out the applications of SSL.
2025
Elaborate the four protocols used in SSL and highlight the interactions between them.
2024
What is Transport Layer Security (TLS)?
2020
With a neat diagram, explain wired and wireless TLS architecture.
2022
Explain the sequence of steps in the SSL Handshake Protocol for establishing a new session. Draw the diagram.
2022
Write short notes on the SSL handshake protocol.
2021
Brief the Secure Socket Layer (SSL). Why do we need IPSec when we can encrypt data at the application layer?
IPSec = network layer, transparent to applications · Transport: protect payload, original header, host-to-host · Tunnel: protect whole packet + new header, gateway-to-gateway VPN · SA (one-way) = SPI + destination + AH/ESP; SAD, SPD, IKE · AH: next header, payload length, reserved, SPI, sequence, auth data · protocol 51 · no privacy · ESP steps: trailer → encrypt → header → auth data → append → IP (50) · ESP trailer: padding, pad length, next header · Sequence number = anti-replay; SPI = which SA · SSL weakness: customer and merchant must trust each other · SET: confidentiality, integrity, authenticate both parties · Entities: cardholder, merchant, issuer, acquirer + gateway, CA · DS = E(KRc, H(H(PI) ‖ H(OI))) · Merchant: OI + PIMD; bank: PI + OIMD
9 important questions
- Differentiate transport and tunnel mode.
- Explain the two modes of IPSec with diagrams.
- Explain IPSec: architecture, modes, security associations and benefits.
- Why was ESP introduced when AH already existed?
- Explain the AH format.
- Explain AH and ESP with packet formats and compare them.
- What is the purpose of the dual signature in SET?
- Explain the dual signature in SET.
- Explain SET: disadvantages of SSL, participants, working and dual signature.
18 previous-year questions
2022
Differentiate between SSL and SET.
2020
Define IPSec. Distinguish between the two modes of IPSec.
2024
Differentiate transport and tunnel mode in IPsec.
2024
Explain the IP security protocol and its modes of operation.
2023
List the benefits of IPSec.
2025
Give an overview of IP security.
2025
Write a note on combinations of SAs in IPsec.
2020
What do you mean by IP security policy?
2024
Discuss the authentication header and encapsulating security payload in detail with packet format.
2024
Differentiate between the authentication header (AH) and encapsulating security payload (ESP).
2021
Draw the IPSec Authentication Header and write short notes on each element.
2022
Explain the IPSec ESP format.
2022
Illustrate IPSEC. Define the protocols under IPSEC.
2026
Explain the components of IPSec architecture. Discuss AH and ESP in detail.
2024
Describe how the SET protocol enables e-transactions. Explain its components.
2025
Elaborate how SET enables e-transactions securely and explain the components involved.
2017
Who are the participants in SET? Describe the sequence of events for a transaction. Explain the concept of the dual signature.
2024
Outline the steps involved in Secure Electronic Transaction.