NMAK16013U Introduction to Modern Cryptography
Volume 2016/2017
Content
- 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.
Learning Outcome
- 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.
Recommended Academic Qualifications
Experience with rigorous
mathematical proofs. Some previous exposure to probability theory.
Some previous exposure to theory of computation (Turing Machines,
boolean circuits) OR experience with writing programs or
algorithms.
Teaching and learning methods
4 hours of lecture and 2
hours of problem sessions every week, for 8 weeks.
Remarks
This course is about the
mathematical and theoretical basis of modern cryptography. Within
this area, our focus will be on mathematical theorems, proofs and
rigorous constructions. We will not discuss computer security in
practice. There will be no programming.
The course is appropriate for students in both Mathematics and Computer Science.
The course is appropriate for students in both Mathematics and Computer Science.
Workload
- Category
- Hours
- Exam
- 60
- Exercises
- 16
- Lectures
- 32
- Preparation
- 98
- Total
- 206
Sign up
Self Service at KUnet
As
an exchange, the guest and credit student - click here!
Continuing Education - click here!
Exam
- Credit
- 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.
- Aid
- All aids allowed
- Marking scale
- passed/not passed
- Censorship form
- No external censorship
One internal examiner
- Re-exam
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.
Course information
- Language
- English
- Course code
- NMAK16013U
- Credit
- 7,5 ECTS
- Level
- Full Degree Master
- Duration
- 1 block
- Placement
- Block 1
- Schedule
- A
- Course capacity
- No restrictions/no limitation
- Continuing and further education
- Study board
- Study Board of Mathematics and Computer Science
Contracting department
- Department of Mathematical Sciences
Course responsibles
- Gorjan Alagic (7-706a756a70726c49766a7d7137747e376d74)
E-mail: galagic@math.ku.dk
Saved on the
12-06-2017