CCS351: Modern Cryptography syllabus for AI&DS 2021 regulation (Professional Elective-IV)

Modern Cryptography detailed syllabus for Artificial Intelligence & Data Science (AI&DS) for 2021 regulation curriculum has been taken from the Anna Universities official website and presented for the AI&DS students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Artificial Intelligence & Data Science 6th Sem scheme and its subjects, do visit AI&DS 6th Sem 2021 regulation scheme. For Professional Elective-IV scheme and its subjects refer to AI&DS Professional Elective-IV syllabus scheme. The detailed syllabus of modern cryptography is as follows.

Course Objectives:

Download the iStudy App for all syllabus and other updates.

Unit I

INTRODUCTION
Basics of Symmetric Key Cryptography, Basics of Asymmetric Key Cryptography, Hardness of Functions. Notions of Semantic Security (SS) and Message Indistinguishability (MI): Proof of Equivalence of SS and MI, Hard Core Predicate, Trap-door permutation, Goldwasser-Micali Encryption. Goldreich-Levin Theorem: Relation between Hardcore Predicates and Trap-door permutations.

Unit II

FORMAL NOTIONS OF ATTACKS
Attacks under Message Indistinguishability: Chosen Plaintext Attack (IND-CPA), Chosen Ciphertext Attacks (IND-CCA1 and IND-CCA2), Attacks under Message Non-malleability: NM-CPA and NM-CCA2, Inter-relations among the attack model

Unit III

Download the iStudy App for all syllabus and other updates.

Unit IV

BUILDING A PSEUDORANDOM PERMUTATION
The LubyRackoff Construction: Formal Definition, Application of the LubyRackoff Construction to the construction of Block Ciphers, The DES in the light of LubyRackoff Construction.

Unit V

MESSAGE AUTHENTICATION CODES
Left or Right Security (LOR). Formal Definition of Weak and Strong MACs, Using a PRF as a MAC, Variable length MAC. Public Key Signature Schemes: Formal Definitions, Signing and Verification, Formal Proofs of Security of Full Domain Hashing. Assumptions for Public Key Signature Schemes: One-way functions Imply Secure One-time Signatures. Shamir’s Secret Sharing Scheme. Formally Analyzing Cryptographic Protocols. Zero Knowledge Proofs and Protocols.

Practical Exercises:

1. Implement Feige-Fiat-Shamir identification protocol.
2. Implement GQ identification protocol.
3. Implement Schnorr identification protocol.
4. Implement Rabin one-time signature scheme.
5. Implement Merkle one-time signature scheme.
6. Implement Authentication trees and one-time signatures.
7. Implement GMR one-time signature scheme.

Course Outcomes:

Download the iStudy App for all syllabus and other updates.

Text Books:

1. Hans Delfs and Helmut Knebl, Introduction to Cryptography: Principles and Applications, Springer Verlag.
2. Wenbo Mao, Modern Cryptography, Theory and Practice, Pearson Education (Low Priced Edition)

Reference Books:

1. ShaffiGoldwasser and MihirBellare, Lecture Notes on Cryptography, Available at http://citeseerx.ist.psu.edu/.
2. OdedGoldreich, Foundations of Cryptography, CRC Press (Low Priced Edition Available), Part 1 and Part 23
3. William Stallings, “Cryptography and Network Security: Principles and Practice”, PHI 3rd Edition, 2006.

For detailed syllabus of all the other subjects of Artificial Intelligence & Data Science 6th Sem, visit AI&DS 6th Sem subject syllabuses for 2021 regulation.

For all Artificial Intelligence & Data Science results, visit Anna University AI&DS all semester results direct link.