Lecture plan

This is a tentative lecture plan, it will be updated every week, numbers with striketrough was not lectured that week. Numbers refer to chapters in Stinson unless otherwise stated, HAC refers to Handbook of Applied Cryptography.

WeekTopicKey wordsChaptersComments
34Classic cryptoClassical ciphers, confidentiality, perfect security, modern ciphers1.1, 1.2, 2.3 (not everything), 3.1, 3.7 affine.py, substitution.py, vigenere.py
35 Classical ciphers, modern ciphers,RSA2.3 ,3.1, 3.7, 5.1, 5.2 (not everything), 5.3
36PKCRSA, ElGamal, Elliptic Curves5.2 (the rest), 5.3, 6.1, 6.4, 6.5.1 elgamal.py
37 Finite groups, Elliptic curves, Diffie Hellman 6.4,6.5.1-6.5.3 possibly: 11.2
38How to agree on a key, primality testing Diffie-Hellman, Legendre symobol, Jacobi symbol 11.1-11.2 (Only DH-KAS), 6.7.3 (Only problem 6.3),5.4
39 Factoring large numbers Factoring, RSA 5.5, 5.6 (Will finish Dixons random square next week factoring.py
40 Attacks on RSA and DLOG RSA, discrete logarithms 5.6 (Finish Dixons random sqaures), 5.7.1, 5.7.2, 6.2.1,6.2.2, 6.2.3 (Lectured as in draft, not as in book),6.3 Draft on discrete logarithms can be found here.
41 Attacks on the discrete logarithm Discrete logarithms 6.2 (Finish Pohlig-Hellman, then Shanks, Pollard Rho and Index Calculus as in draft), 6.3, 6.7.2 The topics of 6.3 has been more or less lectured even though I havent referenced to the chapter
42 ElGamal security, MAC's ElGamal, MAC 6.7.2, 4.1, 4.2 (until, but not with 4.2.2), 4.4.2
43 Digital Signatures RSA signatures, ElGamal signatures, DSA, Schorr signatures 7.1, 7.2, 7.3 7.4.1, 7.4.2
44 Zero-Knowledge Zero-knowledge Lectures
45 Motivational lectures
46 Repetition
47 Old exams
2014-11-14, Anders Smedstuen Lund