Cryptology I

Lecture spring
2020 

Topics covered
20190218 (lecture)  Perfect secrecy. Onetime pad. Limitations of onetimepad/perfect security.  [video] 
20200211 (lecture)  Historical ciphers. Enigma.  [video] 
Homework
Your current amount of points in the homework can be accessed
here.
Out

Due

Homework

Solution

Description
The course "Cryptology I" introduces the basics of
cryptography. After discussing historic ciphers and their weaknesses, we
introduce modern cryptographic primitives such as encryption and signature
schemes, hash functions, oneway functions etc. We explain how the
security of cryptographic schemes is defined and proven. We study advanced
cryptographic schemes such as zeroknowledge proofs and secure function
evaluation.
Requirements
"Elements of Discrete Mathematics" or some
comparable mathematical foundations.
Reading
The following reading supplements this lecture (optional!)
Lindell and Katz,
Introduction to Modern Cryptography, Chapman & Hall, 2007.
Materials from the course "Topics
of Mathematics in Cryptology" (especially the chapter on probability
and the one on modular arithmetic).