CY-603 (B) RGPV B.Tech
Applied Cryptography (AC)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
1 paper, latest Jun 2025
Syllabus, notes and important questions for CY-603 (B)
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 History and Classical Cryptography 8 topics
- History of cryptography
- Background in probability and algorithms
- Classical cryptography: shift cipher, monoalphabetic substitution cipher, polyalphabetic substitution cipher
- Encryption with perfect secrecy and one‑time pad
- Implementation aspects: shared secret randomness vs perfect secrecy
- Modern cryptography principles: one‑way functions, trapdoor functions, hard‑core bits
- Construction of a public‑key cryptosystem based on general cryptographic primitives
- Implementation aspects: computational efficiency vs hardness
Unit 2 Number Theory, Reductions and Symmetric Encryption 10 topics
- Algorithmic number theory and cryptographic assumptions
- Reductions and proofs by reductions
- Number‑theoretic candidates for cryptographic primitives (e.g., factoring)
- Public‑key cryptosystems derived from number‑theory problems
- Brief discussion of quantum computing
- Large integer arithmetic for implemented public‑key cryptosystems
- Randomness and pseudo‑randomness: PRGs, PRFs, permutations
- Symmetric encryption: security notions and schemes based on pseudo‑randomness primitives
- Security proofs for symmetric encryption schemes
- Implementation aspects: generating and testing randomness
Unit 3 Block Ciphers, Modes, Cryptanalysis and Message Authentication 10 topics
- Block ciphers: DES, Triple‑DES, AES
- Substitution‑permutation networks and Feistel networks
- Modes of operation: ECB, CBC, OFB, Counter, GCM
- Cryptanalysis attacks: exhaustive, linear, differential, meet‑in‑the‑middle
- Key length considerations and security‑performance trade‑offs
- Message authentication: CBC‑MAC, HMAC, collision‑resistant hashes (MD5, SHA‑1, SHA‑2, SHA‑3)
- CCA security for symmetric encryption
- Combined confidentiality and integrity schemes
- Application case study: password‑based secure computer access
- Implementation aspects: security‑performance‑features trade‑offs
Unit 4 Asymmetric Encryption and Advanced Primitives 7 topics
- Number‑theoretic primitives: discrete logarithms, elliptic curves
- Asymmetric encryption constructions: RSA variants, El Gamal, hybrid encryption
- Security‑performance‑features trade‑offs for asymmetric schemes
- Malleable and homomorphic encryption: Paillier, brief overview of Gentry’s scheme
- Advanced schemes achieving various security notions (e.g., Cramer‑Shoup)
- Identity‑based encryption
- Implementation aspects: security‑performance‑trust trade‑offs