Supplementary Textbook: https://sagrawalx.github.io/crypt/
1 (09/26)
- Covered history of cryptography
- Frequency Analysis - method for breaking all ciphers
- modern cryptography
- Rectangular Transposition
2 (09/29)
3 (10/01)
- Review on Playfair Cipher
- Modulus
4 (10/03)
5 (10/06)
Quiz
6 (10/8)
- practice Modulus questions
- GCD
- Euclidean Algorithm
- Bezout’s Identity
7 (10/10)
- review on Euclidean Algorithm and Bezout’s Identity
- Modular Inversion
- Affine Cipher
8 (10/13)
- review on Theorem (Modular Inversion)
- Affine Cipher
- Hill Cipher, but no examples.
9 (10/15)
- review on Hill Cipher
| A | B | C | D | E | F | G | H | I | J | K | L | M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 |
- Brief coverage of Frequency Analysis
10 (10/17)
- Quiz
- Playfair Cipher, Masonic Cipher, Vignere Cipher, Modular Arithmetic, GCDs, Euclidean Algorithm, Bezout’s identity
11 (10/20)
- Probability. Won’t add because it’s not hard.