Course detail

Modern Cryptography

FEKT-MPA-MOKAcad. year: 2025/2026

The course covers the topics of modern cryptography and its concrete applications. In particular, the course covers: post-quantum cryptography, lattice-based cryptography, cloud computing, secure data processing, homomorphic encryption, secure multi-party computation, secret sharing, e-voting, blockchain, cryptocurrencies, data privacy, and disclosure risk control.

Language of instruction

English

Number of ECTS credits

6

Mode of study

Not applicable.

Entry knowledge

Students must have a background in cryptography, algebra and programming equivalent to the knowledge provided by compulsory courses ZKR, CPT or AKR of the Bachelor’s program BPC-IBE.

Rules for evaluation and completion of the course

The maximum of 40 points is given upon completion of the laboratories. The maximum of 60 points can be gained by completing the final project.

The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.

Aims

The objective of this course is to provide students with detailed theoretical and practical knowledge of modern cryptographic schemes and their concrete application. The course places great emphasis on practical exercises, where students can try and implement individual technologies themselves.
Students will obtain theoretical and practical knowledge on current modern cryptography and its concrete applications. In particular, the course focuses on post-quantum cryptography, cloud computing, secure data processing, e-voting, cryptocurrencies, and data privacy.
By passing the course, students will be able to develop modern cryptographic systems based on the topics explained in the course.

Study aids

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Bernstein, D.J., Buchmann, J., Dahmen, E.: Post-Quantum Cryptography. Springer. (EN)
Goldreich, O.: Foundations of Cryptography Volume 2 - Basic Applications. Cambridge University Press. (EN)
Hundepool, A., Domingo-Ferrer, J., et al.: Statistical disclosure control. John Wiley & Sons. (EN)
Schoenmakers, B.: Lecture Notes Cryptographic Protocols. Technical University of Eindhoven. (EN)

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme MPAD-ACS Master's 2 year of study, winter semester, compulsory
  • Programme MPC-IBE Master's 2 year of study, winter semester, compulsory-optional

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

Syllabus

1. Introduction to modern cryptography, Number Theory.
2. Modular arithmetics, Algebraic structures.
3. Basic cryptographic primitives overview.
4. Elliptic curve cryptography.
5. Bilinear pairing.
6. Protocols using bilinear pairing.
7. Commitment schemes.
8. Zero-knowledge protocols.
9. Sigma protocols.
10. Sigma protocols II.
11. Group signatures.
12. Attribute-based credentials.  

Exercise in computer lab

26 hod., compulsory

Teacher / Lecturer

Syllabus

Laboratory 1 - Introduction to python
Laboratory 2 - Numpy library and Lattice
Laboratory 3 - LWE problem and Regev scheme
Laboratory 4 - PQC
Laboratory 5 - Homomorphic Encryption
Laboratory 6 - Fully Homomorphic Encryption and Applications
Laboratory 7 - Secret Sharing
Laboratory 8 - Secure Multiparty Computation
Laboratory 9 - Blockchain & Project Discussion
Laboratory 10 - Smart Contracts and Cryptocurrencies
Laboratory 11 - Data Anonymization
Laboratory 12 - K-anonymity