This is the page for the Fall 2018 course, the page for the Fall 2019 course is here

192.062 Introduction to Modern Cryptography

This is the website for the first part of this course (on symmetric crypto), the website for the second part (on public-key crypto) can be found here.

Lecturers Krzysztof Pietrzak ( and Daniel Slamanig (

Teaching assistans Miachel Walter (, Karen Klein ( and Chethan Kamath (

The TU website with dates, locations etc. for the lecture and the tutorial.

To get credit for the lecture one needs to pass the midterm and final exam.
The exams will be in the slots for the tutorial: the midterm exam is Thursday, December 6th 3-5pm and the final exam on Thursday, January 31st 3-5pm.

To get credit for the tutorial, you must get at least 50% of the total points for the homeworks. The concrete grading scheme is grade 1 for 80-100%, 2 for 70-80%, 3 for 60-70%, 4 for 50-60%, 5 (failing grade) for <50%.
You can discuss the homeworks in groups, but everyone must write up and hand in the solutions individually.

Slides for Lecture 1, Introduction and historical ciphers, Oct. 9th
Homework 1
Solutions to Homework 1

Slides for Lecture 2, Perfect Secrecy, Oct. 16th
Homework 2
Solutions to Homework 2

Slides for Lecture 3, Computational Security, Oct. 23th
Homework 3
Solutions to Homework 3

Slides for Lecture 4, Pseudorandom Functions/Permutations, Modes of Operation, CCA security, Oct. 30th
Homework 4
Solutions to Homework 4

Slides for Lecture 5, Secert-Key Authentication, Message-Authentication Codes (MACs), Nov. 6th
Homework 5

Slides for Lecture 6, Authenticated Encryption, Information-Theoretic Authentication, Nov. 13th
There's no Homework for lecture 6.

Slides for Lecture 7, Authenticated Encryption, Cryptographic Hash Functions, Nov. 20th
Homework 7
Solutions to Homework 7

Slides for Lecture 8, Applications of Cryptographic Hash-Functions, Practical Constructions of Secret-Key Primitives, Nov. 27th
Homework 8
Solutions to Homework 8

Midterm exam
Solutions to midterm exam