Institute of Computer Science
Courses.cs.ut.ee Institute of Computer Science University of Tartu
  1. Courses
  2. 2025/26 spring
  3. Post-Quantum Cryptography (LTAT.04.015)
ET
Log in

Post-Quantum Cryptography 2025/26 spring

  • Homepage
  • Lectures
  • Practice Sessions
  • Assignments
  • References

Notes & Slides


Slides, Lecture notes - Quantum Computing and Cryptography

Lecture notes - NIST Standardization Process

Irina's Slides, Lecture notes - Code-Based Cryptography

Lecture notes - Lattice-Based Cryptography

Lecture notes - Hash-Based Cryptography

Lecture notes, CSIDH Slides - Isogeny-Based Cryptography

Lecture notes - Multivariate Cryptography

Slides - From Classic to Post-Quantum Cryptography

Lecture-by-lecture


Lecture 1 (11.02): Course introduction, quantum computing, RSA, Shor's algorithm. Motivation to study post-quantum cryptography.

Lecture 2 (18.02): Public-key encryption, key encapsulation mechanism, digital signature schemes, security notions (IND-CPA, IND-CCA) for PKE. An overview of the NIST standardization process.

Lecture 3 (25.02): Irina's lecture. Coding theory basics, definition of error-correcting code, examples, and generator matrix.

Lecture 4 (04.03): Parity-check matrix, Singleton, Hamming, and Gilbert-Varshamov bounds, general decoding problem.

Lecture 5 (11.03): Syndrome decoding problem, reductions, McEliece PKE, security, hash functions, Fujisaki-Okamoto transform, McEliece KEM.

Lecture 6 (18.03): Cyclic codes, HQC PKE, correctness and security, overview of lattice-based schemes, lattice basics (definition, first minimum, fundamental region, sphere packing problem).

Lecture 7 (25.03): Minkowki's theorem, hard problems on lattices (SVP and CVP, and their approximate versions). Good and bad basis, Babai's algorithm, GGH, hash-and-sign.

Lecture 8 (01.04): q-ary lattices, NTRU lattice, NTRU problem, Falcon digital signature.

Lecture 9 (08.04): Updates about PQC. LWE, MLWE, D-LWE, special rounding function, Kyber PKE.

Lecture 10 (15.04): Correctness and comments o Kyber security. SIS, MSIS, average-case and worst-case, high and low-bits, Dilithium digital signature.

Lecture 11 (22.04): Lamport's one-time signature, Winternitz signature, Merkle trees.

Lecture 12 (29.04): Hypertrees, HORS and HORST (few times signature), SPHINCS+.

Lecture 13 (06.05): Elliptic curves, isogenies, hard problems in isogenies, SIDH and CSIDH.

Lecture 14 (13.05): Multivariate quadratic problem, complexity, linearization, oil and vinegar, UOV signature scheme.

Lecture 15 (20.05): Migration from classic to post-quantum cryptography and course recap.

Lecture 16 (27.05): Report presentations and course wrap-up :)

  • Institute of Computer Science
  • Faculty of Science and Technology
  • University of Tartu
In case of technical problems or questions write to:

Contact the course organizers with the organizational and course content questions.
The proprietary copyrights of educational materials belong to the University of Tartu. The use of educational materials is permitted for the purposes and under the conditions provided for in the copyright law for the free use of a work. When using educational materials, the user is obligated to give credit to the author of the educational materials.
The use of educational materials for other purposes is allowed only with the prior written consent of the University of Tartu.
Terms of use for the Courses environment