|2017-02-15 (lecture)||Classical ciphers.||[video]|
|2017-02-15b (lecture)||Perfect secrecy. One-time pad. Security and limitations of OTP.
Streamciphers (basic construction). LFSR.||[video]|
Your current amount of points in the homework can be accessed
|2017-02-17||2017-03-03||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).