2. [27 II] (guest lecturer: M. Gębala) Complexity theory. NP-hardness, NP-completness. Merkle-Hellman encryption scheme.
3. [6 III] Perfect secrecy. One Time Pad. Computational secrecy. Negligible probability.
4. [13 III] Stream ciphers -- better One Time Pads. Pseudo-random generators. Un-predictability. Examples: 802.11b (WEP), GSM (A5/1), DVD (CSS). (
definitions)
5. [20 III] (guest lecturer: M. Gębala) Modes of operations: CBC, OFB, CTR, ...
6. [27 III] CPA-security (
definitions). Generic construction from any pseudo-random function. Substitution-permutation networks.
7. [3 IV] CCA-security - motivations. Hash functions. Slides:
Intro to hashing by Krystian Matusiewicz and description of Keccak:
SHA-3