|2018-02-14 (lecture)||Historical ciphers.||[video]|
|2018-02-14b (lecture)||Perfect secrecy. One-time pad. Security and limitations of OTP.||[video]|
|2018-02-21 (lecture)||Stream ciphers (ctd.). IND-OT-CPA security. Pseudo-random generators (PRG). Security proof for G(k)⊕m encryption scheme.||[video]|
|2018-02-21 (practice)||Breaking a substitution cipher. Malleability of one-time-pad (bank transfer).|
Your current amount of points in the homework can be accessed
|2018-02-22||2018-03-02||Homework 1|| |
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, one-way functions etc. We explain how the
security of cryptographic schemes is defined and proven. We study advanced
cryptographic schemes such as zero-knowledge proofs and secure function
"Elements of Discrete Mathematics" or some
comparable mathematical foundations.
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).