skip to primary navigationskip to content

Department of Computer Science and Technology

Cryptography

Course pages 2020–21

Cryptography

Contents

Lecture 1 – 2021-01-22

1  Introduction

2  Some basic concepts

3  What is secure

4  A note about message length

5  Historic ciphers

Lecture 2 – 2021-01-24

6  Perfect secrecy and one-time pads

7  Visual-cryptography demo

8  Pseudo-random generators

9  Indistinguishability games with negligible advantage

Lecture 3 – 2021-01-26

10  Our first security proof through reduction

11  CPA security of a private-key encryption scheme

Lecture 4 – 2021-01-28

12  Pseudo-random functions

13  CPA security of encrypting with a PRF

14  Iterating pseudo-random functions and permutations

15  Block ciphers and Feistel structure

Lecture 5 – 2021-02-01

16  DES and AES

17  Blockcipher modes of operation

Lecture 6 – 2021-02-03

18  Message integrity – CCA security, malleability, MACs

19  Message-authentication-code constructs

Lecture 7 – 2021-02-05

20  Authenticated encryption, padding-oracle attack

21  Galois Counter Mode

22  Secure hash functions

Lecture 8 – 2021-02-08

23  Merkle–Damgård construction

24  Davies–Meyer construction and a proof in the random-oracle model

25  SHA-3, sponge and duplex constructions

Lecture 9 – 2021-02-10

26  Generating hash collisions

27  HMAC

28  Secure commitment, Merkle trees

29  Hash chains, TESLA, block chains

Lecture 10 – 2021-02-12

30  Key-derivation functions

31  Rainbow tables, other hash applications

32  Key distribution problem

Lecture 11 – 2021-02-15

33  Public-key encryption – security definitions

34  Number theory

35  Euclid’s algorithm

36  Groups

37  Rings and fields

Lecture 12 – 2021-02-17

38  Galois fields

39  Finite groups

40  Cyclic groups

Lecture 13 – 2021-02-19

41  Fermat’s and Euler’s theorem

42  Chinese remainder theorem

43  Squares and taking roots

44  Subgroup of quadratic residues

45  Square-and-multiply algorithms

46  Discrete logarithm and Diffie–Hellman problems

Lecture 14 – 2021-02-22

47  Discrete logarithm algorithms

48  Schnorr groups

49  Elliptic curves

50  Elliptic-curve group operation

Lecture 15 – 2021-02-24

51  Elliptic curves for cryptography

52  ElGamal encryption scheme

53  Number-theory problems recap

54  RSA trapdoor permutation

Lecture 16 – 2021-02-26

55  Digital signatures

56  Schnorr identification and signature scheme

57  DSA and ECDSA

58  Sony Playstation 3 DSA hack

59  Public-key infrastructure and certificates

60  Outlook

Total duration: 15:09:44