Monday |
Wednesday |
Friday |
| Sept. 3 Labor Day |
Sept. 5 Lecture #1: Introduction to Cryptography Caesar Ciphers |
Sept. 7 Homework 1 Due Lecture #2: Monoalphabetic Substitution Frequency Analysis |
| Sept. 10 Lecture #3: Vigenère Cipher |
Sept. 12 Lecture #4: Modular Arithmetic Divisibility |
Sept. 14 Homework 2 Due Lecture #5: Divisibility Proofs |
| Sept. 17 Quiz 1 Lecture #6: Division Algorithm Mod Operator |
Sept. 19 Lecture #7: Affine Cipher |
Sept. 21 Homework 3 Due Lecture #8: Inverse Mod n |
| Sept. 24 Quiz 2 Lecture #9: GCD Euclidean Algorithm |
Sept. 26 Lecture #10: Bézout Theorem Find the Inverse Mod n |
Sept. 28 Homework 4 Due Lecture #11: Euler Phi Function Speed of Algorithms |
| Oct. 1 Lecture #12: Breaking Affine Hill Cipher |
Oct. 3 Quiz 3 Lecture #13: Matrices |
Oct. 5 Homework 5 Due Lecture #14: Inverse of a Matrix Mod 29 |
| Oct. 8 Quiz 4 Lecture #15: Playfair |
Oct. 10 Lecture #16: Rectangular Transposition |
Oct. 12 Homework 6 Due Lecture #17: Vernam Cipher Binary |
| Oct. 15 Lecture #18: Hexadecimal ASCII Questions for Exam |
Oct. 17 Exam #1 |
Oct. 19 Fall Break |
| Oct. 22 Lecture #19: Open Classroom: Don't Trust but Verify UC128 |
Oct. 24 Lecture #20: Introduction to Probability |
Oct. 26 Homework 7 Due Lecture #21: Probability Random Variables Independent Events |
| Oct. 29 Quiz 5 Lecture #22: Independent Random Variables Expected Value |
Oct. 31 Lecture #23: Expected Value of a sum Conditional Probability |
Nov. 2 Homework 8 Due Lecture #24: Test for a Disease Expected Value of Dice Rolling Dice |
| Nov. 5 Quiz 6 Lecture #25: Introduction to Statistics |
Nov. 7 Lecture #26: χ2-Test |
Nov. 9 Homework 9 Due Lecture #27: Known Plaintext attack on MonoAlpha |
| Nov. 12 Visit From Career Services No Office hours today |
Nov. 14 Lecture #28: Binomial Coefficients IOC |
Nov. 16 Homework 10 Due Lecture #29: Estimiating Vigenère Period |
| Nov. 19 Quiz 7 Lecture #30: Introduction to Public Key Euler's Theorem |
Nov. 21 Thanksgiving Break |
Nov. 23 Thanksgiving Break |
| Nov. 26 Lecture #31: Fermat's Little Theorem Powermod |
Nov. 28 No Class No Office Hours Today |
Nov. 30 Lecture #32: RSA |
| Dec. 3 Homework 11 Due Lecture #33: RSA Implementation |
Dec. 5 Quiz 8 Lecture #34: Digital Signatures |
Dec. 7 Homework 12 Due Lecture #35: Finding Primes Big RSA example |
| Dec. 10 Lecture #36: Big RSA Problem |
Dec. 12 Lecture #37: Is cryptography good? |
Dec. 14 Homework 13 Due Lecture #38: Questions for the Final (If you can find me) |
Friday, December 21 at 11:00 AM. |
||