### 192.062 Introduction to Modern Cryptography, Fall 2019

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 (pietrzak@ist.ac.at) and Daniel Slamanig (Daniel.Slamanig@ait.ac.at).

Teaching assistans Frederick Klinser (e11776880@student.tuwien.ac.at), Karen Klein (karen.klein@ist.ac.at),
Chethan Kamath (ckamath@ist.ac.at), Michael Walter (michael.walter@ist.ac.at),
Guillermo Perez (guillermo.pascualperez@ist.ac.at)

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.

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. 8th

Homework 1

Solutions to Homework 1

Slides for Lecture 2, Perfect Secrecy, Oct. 15th

Homework 2

Solutions to Homework 2

Slides for Lecture 3, Computational Security, Oct. 22th

Homework 3

Solutions to Homework 3

Slides for Lecture 4, Pseudorandom Functions/Permutations, Modes of Operation, CCA security, Oct. 29th

Homework 4

Solutions to Homework 4

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

Homework 5

Solutions to Homework 5

Slides for Lecture 6, Authenticated Encryption, Information-Theoretic Authentication, Nov. 12th

Homework 6

Slides for Lecture 7, Cryptographic Hash Functions, Nov. 21th

There's no homework for lecture 7

Slides for Lecture 8, Applications of Cryptographic Hash-Functions, Practical Constructions of Secret-Key Primitives, Nov. 26th

Homework 8