Credit points: 3.0

Introduction to classical cryptology from Caesar to Shannon, including substitution ciphers, perfect ciphers, unicity distance, and random ciphers. The modern approach to cryptography. Block ciphers, the Data Encryption Standard and their analysis. Merkle's puzzles. One-time signatures. Public-key cryptosystems. Introduction to number theory, RSA, and Rabin's signature. Secret Sharing, Zero-knowledge proofs,Fiat-Shamir identification scheme. Contract Signing, Mutual Commitment schemes.

#### 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

**All the above prerequisites are MANDATORY. Any exception will be handled only via the lecturer in charge.**