Over the last four decades, Modern Cryptography has developed into a field with solid mathematical foundations. In addition to developing the idea of "provable security," investigations into the fundamental nature of secrecy and security threw open a range of new possibilities that go well beyond encryption. This course will introduce you to some of these tools, as well as basic concepts needed to formally define and prove their security.
Course contents. The topics we will try to cover (as time permits) include
The course project will give you a chance to read up on topics not covered in the lectures and/or implement an advanced cryptographic tool.
Graded Work. The graded work involves two exams or quizzes (60%), a few homework assignments (20%), a team project (20%). The final grade will be determined also based on lecture attendance (see below). The projects will be evaluated based on a presentation and either a report or a demo (depending on the nature of the project), and meeting(s) with the instructor prior to that. Some sample topics for the project will be provided later on. The quiz schedule will be announced later.
Attendance Policy. The students are expected to regularly attend all the live lectures. The lectures include a lot of material that will not be covered by assignments or quizzes, and interaction during the lectures would be key to learning such material. Attendance falling below 80% will result in losing one grade point. (However, if there are excruciating circumstances for students not on campus, you may obtain the instructor's permission to catch the lecture recordings instead of attending live.)
Background. This course will have a theoretical flavour: you will need to be comfortable with mathematical definitions and proofs ("mathematical maturity"). Specific mathematical topics that will be encountered are elementary probability, linear algebra and discrete mathematics.
Teaching Assistant: Kaartik Bhushan