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, e.g., the Data Encryption Standard (DES), 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.
Time permitting, we will also discuss more modern aspects such crypto currencies, multiparty computation and fully homomorphic encryption.
- 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