{"id":56435,"date":"2023-08-28T16:32:58","date_gmt":"2023-08-28T16:32:58","guid":{"rendered":"https:\/\/www.inspirenignite.com\/anna-university\/ccs351-modern-cryptography-syllabus-for-cyber-security-2021-regulation-professional-elective-iii\/"},"modified":"2023-08-28T16:32:58","modified_gmt":"2023-08-28T16:32:58","slug":"ccs351-modern-cryptography-syllabus-for-cyber-security-2021-regulation-professional-elective-iii","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/ccs351-modern-cryptography-syllabus-for-cyber-security-2021-regulation-professional-elective-iii\/","title":{"rendered":"CCS351: Modern Cryptography syllabus for Cyber Security 2021 regulation (Professional Elective-III)"},"content":{"rendered":"

Modern Cryptography detailed syllabus for Cyber Security (Cyber Security) for 2021 regulation curriculum has been taken from the Anna Universities<\/a> official website and presented for the Cyber Security 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. <\/p>\n

For Cyber Security 6th Sem scheme and its subjects, do visit Cyber Security 6th Sem 2021 regulation scheme<\/a>. For Professional Elective-III scheme and its subjects refer to Cyber Security Professional Elective-III syllabus scheme<\/a>. The detailed syllabus of modern cryptography is as follows. <\/p>\n

Course Objectives:<\/h4>\n

Download the iStudy App for all syllabus and other updates.<\/a>
\"Get<\/a><\/h4>\n

Unit I<\/h4>\n

INTRODUCTION
\nBasics 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.\n<\/p>\n

Unit II<\/h4>\n

FORMAL NOTIONS OF ATTACKS
\nAttacks 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\n<\/p>\n

Unit III<\/h4>\n

Download the iStudy App for all syllabus and other updates.<\/a>
\"Get<\/a><\/h4>\n

Unit IV<\/h4>\n

BUILDING A PSEUDORANDOM PERMUTATION
\nThe LubyRackoff Construction: Formal Definition, Application of the LubyRackoff Construction to the construction of Block Ciphers, The DES in the light of LubyRackoff Construction.\n<\/p>\n

Unit V<\/h4>\n

MESSAGE AUTHENTICATION CODES
\nLeft 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.\n<\/p>\n

Practical Exercises<\/h4>\n
    \n
  1. Implement Feige-Fiat-Shamir identification protocol.<\/li>\n
  2. Implement GQ identification protocol.<\/li>\n
  3. Implement Schnorr identification protocol.<\/li>\n
  4. Implement Rabin one-time signature scheme.<\/li>\n
  5. Implement Merkle one-time signature scheme.<\/li>\n
  6. Implement Authentication trees and one-time signatures.<\/li>\n
  7. Implement GMR one-time signature scheme.<\/li>\n<\/ol>\n

    Course Outcomes:<\/h4>\n

    Download the iStudy App for all syllabus and other updates.<\/a>
    \"Get<\/a><\/h4>\n

    Text Books:<\/h4>\n
      \n
    1. Hans Delfs and Helmut Knebl, Introduction to Cryptography: Principles and Applications, Springer Verlag.<\/li>\n
    2. Wenbo Mao, Modern Cryptography, Theory and Practice, Pearson Education (Low Priced Edition)<\/li>\n<\/ol>\n

      Reference Books:<\/h4>\n
        \n
      1. 1.ShaffiGoldwasser and MihirBellare, Lecture Notes on Cryptography, Available at<\/li>\n