### PTCCS351 Syllabus - Modern Cryptography - 2023 Regulation Anna University

## PTCCS351 Syllabus - Modern Cryptography - 2023 Regulation Anna University

PTCCS351 |
MODERN CRYPTOGRAPHY |
L T P C |
---|

**2 0 2 3**

**COURSE OBJECTIVES:**

• To learn about Modern Cryptography.

• To focus on how cryptographic algorithms and protocols work and how to use them.

• To build a Pseudorandom permutation.

• To construct Basic cryptanalytic techniques.

• To provide instruction on how to use the concepts of block ciphers and message authentication codes.

• To focus on how cryptographic algorithms and protocols work and how to use them.

• To build a Pseudorandom permutation.

• To construct Basic cryptanalytic techniques.

• To provide instruction on how to use the concepts of block ciphers and message authentication codes.

UNIT I |
INTRODUCTION |
6 |
---|

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 |
6 |
---|

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 |
RANDOM ORACLES |
6 |
---|

Provable Security and asymmetric cryptography, hash functions. One-way functions: Weak and Strong one-way functions. Pseudo-random Generators (PRG): Blum-Micali-Yao Construction, Construction of more powerful PRG, Relation between One-way functions and PRG, Pseudo- random Functions (PRF)

UNIT IV |
BUILDING A PSEUDORANDOM PERMUTATION |
6 |
---|

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 |
6 |
---|

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.

**30 PERIODS**

PRACTICAL EXERCISES: | 30 PERIODS |
---|

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.

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:**

CO1: Interpret the basic principles of cryptography and general cryptanalysis.

CO2: Determine the concepts of symmetric encryption and authentication.

CO3: Identify the use of public key encryption, digital signatures, and key establishment.

CO4: Articulate the cryptographic algorithms to compose, build and analyze simple cryptographic solutions.

CO5: Express the use of Message Authentication Codes.

CO2: Determine the concepts of symmetric encryption and authentication.

CO3: Identify the use of public key encryption, digital signatures, and key establishment.

CO4: Articulate the cryptographic algorithms to compose, build and analyze simple cryptographic solutions.

CO5: Express the use of Message Authentication Codes.

**TOTAL:60 PERIODS**

**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)

2. Wenbo Mao, Modern Cryptography, Theory and Practice, Pearson Education (Low Priced Edition)

**REFERENCES:**

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.

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.

## Comments

## Post a Comment