M. Tech. (Cryptology and Security), III semester

Instructors: Mridul Nandi <mridul.nandi@gmail.com>, Ashwin Jha <ashwin.jha1991@gmail.com>

Time and location: Mon-Wed-Fri 10:30-11.20am, over Zoom (contact instructors for meeting ID)

###### Information

This course gives a comprehensive introduction to some advanced topics in cryptology. The focus is on the foundations of modern cryptology, studying various cryptographic tools and protocols, understanding security models and notions, and attacking or proving the security under these models.

Topics (tentative): Perfect and computational secrecy, foundations (one way function, hardcore bits and PRG, PRF/PRP, trapdoor function), (symmetric-key and public-key) encryption, authentication and digital signatures, authenticated encryption, introduction to lattice-based cryptography and elliptic curve cryptography, cryptographic protocols (multi-party computation and zero-knowledge proofs).

Required background: Cryptology (M. Tech. CrS) or Cryptology (M. Tech. CS). Willingness to understand and write mathematical definitions and proofs. Familiarity with discrete probability, discrete mathematics, number theory, algebra and theory of computing is also expected.

###### Resources

Although there is no mandatory textbook, the topics discussed in this course are largely based on the following list of references:

This list is dynamic. So, keep looking regularly for any updates.
###### Lectures

Lecture schedule along with supporting notes and references will be posted here (in an online manner). Any homeworks and/or assignments based on the topics till date will be posted alongside the lecture. For the time being, lecture slides will be shared privately.

Week Content Notes and References Homework/Assignment
1
• (Probabilistic) Interactive Algorithms
• Statistical Distance
• Computational Distance
See chapter 8 of (B4) for basic discrete probability and statistical distance.
2
• Reductions
• (Pseudo) Perfect Secrecy
See chapter 2-3 of (B1).