- Understand the services cryptographic schemes offer, their security definitions and what their security is based on in the real world
- Get familiar with the most common cryptographic primitives, their security requirements and the design principles behind them
- Get familiar with the most common cryptographic modes of use, their security properties and the methods to prove them secure
- Learn the basic mathematics behind cryptographic primitives
- Perform basic computation required for public key cryptosystems and their cryptanalysis
- Critically evaluate (security of) cryptographic schemes
This course provides an introduction to modern cryptography.
It includes a refresh of basic number theory and algebra such as groups and finite fields and then treats symmetric cryptography and public key cryptography. It explains security definitions for block ciphers, stream ciphers, MAC functions, hash functions.. It provides an introduction to cryptanalysis and generic attacks including exhaustive key search. It defines the concept of security strength and the basis for cryptographic security: public scrutiny.
In symmetric cryptography it discusses the design principles and cryptanalysis of stream ciphers and treats block ciphers and hash functions and their modes of use.
For the latter, it is shows how reductionist security proofs can be given.
In public key cryptography the course treats key establishment protocols, public key encryption, authentication protocols and signature schemes and treats their security definitions. It covers RSA and discrete-log based crypto over cyclic subgroups of multiplicative groups modulo a prime and elliptic curve groups.
It treats different attack methods for solving the discrete log problem and the consequence for the size parameters of the group used in discrete-log cryptography.
They include Diffie-Hellman key exchange. ElGamal encryption, Schnorr authentication protocol, the Fiat-Shamir transform, Schnorr signatures and (EC)DSA.
The bachelor courses Security (NWI-IPC021), Mathematical Structures (NWI-IPC020), Combinatorics (NWI-IBC016) and Matrix Calculation (NWI-IPC017).
Final grade is 0.1 times the homework plus 0.9 times the grade of the final exam
The class will be given in English on campus. If that would be impossible due to COVID measures or similar, it will be online via Zoom and recordings will be made available in Brightspace.|
Please note: This course has been moved from Q3-4 to Q1-2.