CB3491 Cryptography and Cyber Security Previous Year Question Papers - Anna University
Access Anna University Cryptography and Cyber Security (CB3491) previous year question papers on LearnSkart for smarter semester exam preparation. This Anna University PYQ page offers year-wise Anna University exam papers aligned with Regulation 2021, so students can understand recurring questions, important units, and expected marking schemes. You can view every CB3491 Cryptography and Cyber Security question paper online and use free PDF download options for focused revision before internal and semester exams.
2024
-
2024 - CSE-AM-2024-CB 3491-Cryptography and cyber Security-613577702-50356.pdf
-
2024 - CSE-ND-2024-CB 3491-Cryptography and cyber security -673001700-20250604161745 (18).pdf
2023
-
2023 - CSE-ND-2023-CB 3491-Cryptography and network security -959319199-20336.pdf
Important Questions - CB3491 Cryptography and Cyber Security
UNIT I: Introduction and Number Theory
Part A (2 Marks)
- Define Cryptography and Cryptanalysis.
- What is the difference between a Monoalphabetic and Polyalphabetic cipher?.
- Define Steganography and its common techniques.
- Explain the "Avalanche Effect" in encryption.
Part B (13/16 Marks)
- OSI Security Architecture: Detailed explanation of the model with a neat diagram.
- Classical Encryption Techniques: Thorough discussion of substitution and transposition techniques with examples.
- Model for Network Security: Components and working mechanism.
- Foundations of Modern Cryptography: Perfect security and information theory.
UNIT II: Symmetric Ciphers
Part A (2 Marks)
- State the disadvantages of Double DES.
- What are the four different stages of the AES encryption process?.
- Explain the role of S-boxes in the DES algorithm.
- Briefly describe the working principle of the RC4 stream cipher.
Part B (13/16 Marks)
- Data Encryption Standard (DES): Detailed architecture, encryption process, and evaluation of its strength.
- Advanced Encryption Standard (AES): Systematic structure, round functions, and comparison with DES.
- Block Cipher Modes of Operation: Explanation of ECB, CBC, CFB, OFB, and Counter modes.
- Mathematical Foundations: Groups, rings, and finite fields in symmetric key cryptography.
UNIT III: Asymmetric Cryptography
Part A (2 Marks)
- State Euler's Totient function and its significance.
- What is the Discrete Logarithm Problem?.
- Define Public-Key Certificate and its requirements.
Part B (13/16 Marks)
- RSA Algorithm: Key generation, encryption/decryption steps, and possible security threats.
- Diffie-Hellman Key Exchange: Working mechanism, an illustrative example, and vulnerability to Man-in-the-Middle attacks.
- Chinese Remainder Theorem (CRT): Statement, proof, and its application in cryptographic computations.
- Elliptic Curve Cryptography (ECC): Arithmetic operations, Diffie-Hellman using ECC, and its advantages over RSA.
UNIT IV: Message Authentication and Integrity
Part A (2 Marks)
- Distinguish between a Hash function and a Message Authentication Code (MAC).
- What are the requirements for a digital signature?.
- Briefly explain the role of X.509 certificates in security.
Part B (13/16 Marks)
- Hash Functions: Detailed study of SHA and the structure of HMAC.
- Digital Signatures: Principles, requirements, and standard algorithms.
- Authentication Protocols: Architecture and certification mechanisms in Kerberos.
UNIT V: Cyber Security and Social Engineering
Part A (2 Marks)
- What is SQL Injection and its potential consequences?.
- Define "Phishing" and its impact on cyber security.
- What is the difference between active and passive security threats?.
Part B (13/16 Marks)
- Classification of Cyber Crimes: Comprehensive overview and real-world examples.
- Network Security: In-depth look at Cloud, Web, and Wireless security protocols.
- Tools and Methods: Common techniques used in cyber crimes and their countermeasures.
Most Repeated / High-Weight Questions
DES and AES encryption algorithms, RSA key generation and encryption, Diffie-Hellman key exchange, hash functions and digital signatures, block cipher modes of operation, cyber attack classification and countermeasures.
Additional Resources
How to Use These Question Papers
- Cryptographic Algorithms Focus: Master DES (Unit II), AES (Unit II), and RSA (Unit III). Complete cipher rounds manually with sample inputs. Understand key generation and encryption/decryption steps thoroughly.
- Number Theory Mastery: Understand Euler's totient function, modular arithmetic, prime number generation. Study discrete logarithm problem and computational complexity. These mathematical foundations appear with 13-16 marks.
- Key Exchange & Digital Signatures: Trace Diffie-Hellman protocol step-by-step. Understand RSA signing/verification and hash function properties. Practice with sample numerical values.
- Cyber Threats & Defense: Know classification of cyber crimes, attack vectors (SQL injection, phishing), and countermeasures. Understand network security protocols for cloud, web, and wireless systems.
- Time Management: Allocate 60-90 minutes per cryptographic algorithm problem; practice encryption/decryption with sample inputs and detailed mathematical calculations under timed conditions.
Frequently Asked Questions about CB3491 Cryptography and Cyber Security
Which topics are most important in CB3491 exams?
DES and AES encryption algorithms (Unit II), RSA encryption and Diffie-Hellman key exchange (Unit III), hash functions and digital signatures (Unit IV), and cyber attack classification (Unit V) together account for 75% of exam marks. Practice encryption with sample numerical values.
How should I approach DES and AES questions in CB3491?
Understand DES rounds, S-boxes, P-boxes, and key schedule. Know AES stages: SubBytes, ShiftRows, MixColumns, AddRoundKey. Practice manual encryption with small sample inputs. Compare strengths/weaknesses. These algorithm trace problems appear with 13-16 marks.
What is the best strategy for RSA questions in CB3491?
Master key generation (choose p, q, compute n and phi, find e and d). Understand encryption/decryption formulas: C=M^e mod n, M=C^d mod n. Practice with small numbers (p=7, q=11). Know security threats and why RSA is secure based on factorization difficulty.
How can I master Diffie-Hellman key exchange in CB3491?
Understand the protocol: select prime p and generator g, each party generates private key, compute public key as g^private mod p, compute shared secret as (others_public)^private mod p. Trace with numerical example. Know man-in-the-middle vulnerability and defenses.
What should I prioritize in hash functions and digital signatures?
Understand SHA hash function properties (one-way, collision-resistant, deterministic). Know HMAC construction and MAC functions. Master digital signature concepts: sign with private key, verify with public key. These appear as 13-16 mark authentication and integrity questions.
How should I handle cyber attack classification questions in CB3491?
Understand active vs passive threats. Know specific attacks: SQL injection, cross-site scripting (XSS), phishing, malware, DDoS. Learn cloud/web/wireless security protocols and defense mechanisms. Focus on real-world attack scenarios and practical countermeasures for each threat type.