Credit points: 3.0
Introduction to classical cryptology from Caesar to Shannon, including substitution ciphers, perfect ciphers, and random ciphers. The modern approach to cryptography: block ciphers (including DES and AES), public-key cryptography and relevant number theory, RSA, secret sharing, zero-knowledge proofs, post-quantum (lattice-based) cryptography and homomorphic encryption. Time- permitting: secure multi-party computation and blockchains.
Grading policy
- 30% Homework
- 70% Final Exam
The exercises are obligatory. Exam grades below 50 will not be combined with the grades of the exercises!
Prerequisites and Requirements
- Introduction to Probability theory - 094412
- Modern Algebra H - 104134
- Computability Theory - 236343
The above prerequisites are MANDATORY, exceptions will be handled only via the lecturer in charge.