| Date | Lecture | Notes | Assigned Reading | What is Due |
|---|---|---|---|---|
| Week 1 | ||||
| 8/31 | Historical Cryptography.
Intro to Sage and Latex. Classical Cryptography: Caesar cipher and modular arithmetic |
|||
| 9/2 | Classical Cryptography: Cryptanalysis, affine cipher and the Vigenere Cipher (Multiplication table modulo 26) |
Chapter 1, Section 2.1-2.3 | Homework 0 | |
| Week 2 | ||||
| 9/7 | Classical Cryptography: Substitution, Playfair and ADFGX ciphers | Sections 2.4-2.7 | Group Discussion Questions 1 | |
| 9/9 | Basic Number Theory: Euclid's Algorithm | Sections 3.1, 3.2 | Project 1 (Vigenere) | |
| Week 3 | ||||
| 9/14 | Basic Number Theory: Congruences, the CRT | Sections 3.3, 3.4 | Group Discussion Questions 2 | |
| 9/16 | Basic Number Theory: Modular Exponentiation, Fermat and Euler's Theorems | Sections 3.5, 3.6 | Homework 1 | |
| Week 4 | ||||
| 9/21 | Basic Number Theory: Primitive Roots, Inverting Matrices Mod n | Sections 3.7, 3.8 | Group Discussion Questions 3 | |
| 9/23 | Basic Number Theory: Square Roots Mod n, Legendre and Jacobi Symbols | Sections 3.9 and 3.10 | Homework 2 | |
| Week 5 | ||||
| 9/28 | Groups, Rings and Finite Fields | Section 3.11 | Group Discussion Questions 4 | |
| 9/30 | Finite fields, polynomials over finite fields | Section 3.11 | Homework 3 | |
| Week 6 | ||||
| 10/5 | Stream Ciphers, Pseudo-Random Bit Generation, LFSR sequences | Section 5.1, 5.2 | Group Discussion Questions 5 | |
| 10/7 | Midterm 1 | |||
| Week 7 | ||||
| 10/12 | The one time pad | Sections 4.1, 4.2, 4.3 | ||
| 10/14 | Perfect Secrecy, Indistinguishability and Security | Sections 4.4 and 4.5 | Project 2 (Random Numbers) | |
| Week 8 | ||||
| 10/19 | Block Ciphers, Hill Ciphers | Sections 6.1, 6.2 | ||
| 10/21 | SAES | Chapter 8 | Homework 4 | |
| Week 9 | ||||
| 10/26 | SAES | Section 6.3 | ||
| 10/28 | SAES, Modes of Operation | Section 9.1, 9.2 | Project 3 (AES) | |
| Week 10 | ||||
| 11/2 | Modes of Operation, RSA | Section 9.3 | ||
| 11/4 | RSA, Primality Testing | Sections 9.4, 9.5 | Project 4 (Modes of Operation) | |
| Week 11 | ||||
| 11/9 | Dixon's Factorization Algorithm | Sections 9.7, 10.1, 10.4 | ||
| 11/11 | Public Key Cryptography, Discrete Logarithm Problem and the Diffie-Hellman Key Exchange | Sections 10.2, 10.5 | Homework 5 | |
| Week 12 | ||||
| 11/16 | ElGamal Cryptosystem and Computing Discrete Logs | |||
| 11/18 | Midterm 2 | |||
| Week 13 | ||||
| 11/25 | ||||
| 11/27 | THANKSGIVING | |||
| Week 14 | ||||
| 11/30 | ||||
| 12/2 | ||||
| Week 15 | ||||
| 12/7 | ||||
| 12/9 | ||||
| 12/21 | Final Exam Section 003 (12:30 PM) | |||
