| Class Timings | MON: 15:00--16:55; TUE: 14:00--15:55 |
| Venue | CSE 120 |
| Instructors | Monosij Maitra and Somindu Chaya Ramanna |
| Teaching assistants | Soumojit Chatterjee |
We assume basic familiarity with probability theory, algebraic structures (groups, rings, fields), linear algebra and algorithms. Some exposure to computational complexity is useful as well. These topics will not be covered in the course. No prior exposure to cryptography is necessary.
Below is a list of topics for the term paper. You are free to choose any topic outside of this list as long as it aligns with the theme of the course. Please contact the instructors if you need help finding reading material related to your topic.
The report (prepared in LaTeX) should discuss in detail atleast one non-trivial result with a complete analysis. It should
be self-contained with an introduction explaining the importance of the topic. Pay attention to language aspects such as grammar
and spelling. You are allowed to use material from other sources. But, you must understand and express in your own language and provide proper
references. Directly copying from other sources is forbidden and will be heavily penalised.
Evaluation criteria are as follows.
Report:
| Week | Date | Topics Covered |
|---|---|---|
| 1 | 5 January | Introduction |
| 6 January | Perfect secrecy: definition, equivalent definitions, one-time pads; Limitations of perfect secrecy | |
| 2 | 12 January | Shannon's theorem; Computational secrecy -- motivation, formalising security under different threat models; Reductionist arguments and hardness assumptions, |
| 13 January | Pseudorandomness; Pseudorandom generators (PRGs); Using PRGs to construct secure encryption Tutorial 1 - Perfect Secrecy |
|
| 3 | 19 January | Variable-length and multiple encryptions, Security against Chosen Plaintext Attacks Pseudorandom functions |
| 20 January | IND-CPA-secure encryption from PRFs Modes of Operation |
|
| 4 | 26 January | No Class - Institute Holiday (Republic Day) |
| 27 January | Tutorial 2 - Computational secrecy: IND-EAV security, PRGs, IND-CPA security, PRFs | |
| 5 | 2 February | Message authentication codes (MACs) |
| 3 February | Variable length MACs Cryptographic hash functions and their security definitions Merkle-Damgård Construction |
|
| 6 | 9 February | MACs from hash functions - NMAC, HMAC |
| 10 February | Defining CCA security CCA-secure encryption from MACs and CPA-secure encryption |
|
| 7 | 16 February | Test 1 |
| 17 February | Tutorial 3 - MACs and Hash Functions | |
| 18 - 26 February | Mid-Semester Examination | |
| 8 | 2 March | One-way functions, Candidate constructions Hard-core Predicates |
| 3 March | Pseudorandom objects from one-way functions: PRG from OWP+hard-core predicate, GGM construction |
|
| 9 | 9 March | Introduction to public key cryptography, Defining PKE and security |
| 10 March | Tutorial 4 - One-Way Functions and Hardcore Predicates | |
| 10 | 16 March | PKE: Proving equivalence of multi-challenge CPA and single-challenge CPA security, discussion on CCA security |
| 17 March | A primer on basic number theory, group theory and factoring assumption | |
| 11 | 23 March | RSA assumption, RSA Encryption, Primer on Cyclic Groups, Discrete logarithm |
| 24 March | Discrete logarithm (Contd.), Discussions on Choices of Cyclic groups, Algorithms to test and find generators, Diffie-Hellman assumptions, Diffie-Hellman Key Exchange El Gamal encryption, CCA Security |
|
| 12 | 30 March | DHKE (Contd.), revisting PKE: El Gamal encryption, CCA Security Tutorial 5 - Number Theory and Public-Key Encryption |
| 31 March | No Class - Institute Holiday (Mahavir Jayanti) | |
| 13 | 6 April | |
| 7 April | ||
| 14 | 13 April | |
| 14 April | ||
| 15 | 20 April | |
| 21 April | No Class | |
| 20 - 30 April | End Semester Examination |