NMAK16013U Introduction to Modern Cryptography
MSc Programme in Mathematics
- review of basic concepts from probability theory and the theory of computation, random variables, turing machines, the circuit model;
- basics of encryption schemes, perfect security vs practicality
- Computational security and pseudorandomness: one-way functions, pseudorandom generators, pseudorandom functions, pseudorandom permutations
- private-key encryption, security against chosen plaintext attacks
- public-key cryptography
We will also describe some example constructions; how many we cover depends on interest and time. Some options are: RSA, Diffie-Hellman, McEliece, lattice crypto, DES, AES.
If time permits, we may also explore some current topics, such as fully-homomorphic encryption, obfuscation, or quantum cryptography.
- Knowledge: the students will have an understanding of the theoretical and mathematical basis of modern cryptographic systems, including some explicit examples.
- Skills: the students will be able to give rigorous security proofs of basic cryptographic systems, and connect various cryptographic primitives with rigorous reductions.
- Competencies: understanding theorems about theoretical cryptography; proving security reductions; reasoning about the limits of computationally-bounded adversaries.
The course is appropriate for students in both Mathematics and Computer Science.
- 7,5 ECTS
- Type of assessment
- Continuous assessment5 homework sets. All must be passed individually (60% grade or higher.) The first homework set can be resubmitted once.
- All aids allowed
- Marking scale
- passed/not passed
- Censorship form
- No external censorship
One internal examiner
25 minute oral exam with no preparation time and no aids. Several internal examiners.
Criteria for exam assesment
The student must in a satisfactory way demonstrate that he/she has mastered the learning outcome of the course.