TMA4155, fall 2010: Lectures

T&W Trappe & Washington
NNT Note on number theory
NSC Note on symmetric crypto
no week what ref
1 34 Introduction, Caesar, Vigenère, substitution ciphers, congruences and “modulo arithmetic”.
Extended notes from week 34.
T&W 2.1–2.4, 3.3
2 35 Affine cipher, GCD, Euclidean and extended Euclidean algorithm, congruences, modular exponentiation T&W 2.2, 3.1–3.5
3 36 Briefly on Diffie–Hellman, ElGamal. Chinese remaninder thm, Fermat, Euler's φ, RSA (slides)
First look at block ciphers
NNT
4 37 More on block ciphers: Feistel, a little on DES, even less on AES. Block cipher modes: ECB, CBC. NSC, T&W 4.1–2, 4.4–5, 4.7
5 38 More block cipher modes: OFB, counter. Stream ciphers. MAC, HMAC. Primality testing (Fermat, Miller–Rabin), finding safe primes and generators NSC, NNT, T&W 4.5, 6.3
6 39 Square roots mod p, factoring, discrete logarithms
(there will probably not be time for all of the above)
T&W 3.9, 3.10 (first page) 6.4, (6.5–7), 7.1–2
7 40 More on discrete logarithms. Pollard's ρ, Pohlig–Hellman. Bit commitment.
The slides have been extended and updated after Friday's lecture.
T&W 7
8 41 One-time pad, Pedersen commitment (*), secret splitting, threshold schemes, more? T&W 2.9, 12.1–2. (*) not in T&W – to appear in NNT
9 42 Digitial signatures (slides), hash T&W 9, 8.1, (8.2, 8.3), 8.4, NSC
10 43 MAC, AES (a whirlwind tour including some of the underlying algebra) (slides) NSC, T&W 5
11 44 Telephone coin tossing, number theory recap. Note on Euclid's extended algorithm in practice, Maple demo (pdf/maple) T&W 13.1
14 47 Symmetric crypto summary, last year's exam. The slides are a bit rough around the edges.
2010-11-26, Harald Hanche-Olsen