| Dates | Reading: Sinkov | Reading: Barr | Class topics/activities | Due |
|---|---|---|---|---|
| Jan. 5 | 1.1-1.4 | 2.1 | Introduction
Caesar cipher Modular arithmetic Direct standard alphabets "Completing the plain component" | |
| Jan. 6 | 1.5-1.8 | 2.2 | Characteristic letter frequencies
"Slides" Decimation Solution of decimated standard alphabets Monoalphabets based on linear (affine) transformations Mod operator, mod relation, divisibility, gcd Solving linear congruences Formation of cryptogram-solving teams | HW 1-3 |
| Jan. 7 | 1.1 | 1:00 p.m. Video: Codebreakers | ||
| Jan. 8 | 1.1 | A Crypto-Chronology & Exercises with Professor Karl Knight
Make sure you work problems 1-6, 9-11 & 14 before the exam. You may consult with one another and Prof. Knight in class. After that, work on your own. Compete to see who can solve the most section 1.1 problems by Monday. | ||
| Jan. 9 | Chapter 1 | 1.1, 2.1-2.2 | 1:00 p.m. EXAM 1 | |
| Jan. 12 | 2.1-2.2, 2.4 | 1.2-1.3, 2.3 | Discuss Barr section 1.1.
Cryptology & math Glossary of cryptology terms Alice, Bob, and Eve Overview of types of ciphers General monoalphabetic substitution Mixed alphabets: ACA schemes Solution of Aristocrats | HW 4-7
Crypts #1 |
| Jan. 13 | 2.3 | 2.3 #5 | Solution of Patristocrats, monoalphetic substitution without word divisions | HW 8 |
| Jan. 14 | Work on crypts. | |||
| Jan. 15-16 | 3.1-3.3 | 2.5-2.7 | Polyalphabetic substitution
Vigenere encipherment/decipherment Kasiski test Friedman's index of coincidence | R 1/15 Crypts #2 HW 9 |
| Jan. 19 | 2.1-3.3 | 2.1-2.3,2.5-2.7 | EXAM 2 | Crypts #3 HW 10 |
| Jan. 20 | 3.4-3.7 | 2.8 | Review of exam
Solution of polyalphabetic crypts Polygraphic systems Wheatstone-Playfair cipher Hill's system | makeup |
| Jan. 21 | Ch. 4 | 2.9 | Maple
Hill's digraphic system | Project proposal makeup |
| Jan. 22 | Ch. 4 | Hill's digraphic system: case study & problems | Project proposal (if not done Wed.)
Crypt #4 HW 11,12 | |
| Jan. 23 | 5.1-5.3 | 2.4 | Transposition ciphers ("tramps")
Railfence ciphers Columnar transpositions Enciphering/deciphering Solving complete columnar transpositions | |
| Jan. 26 | Chs. 3-5.1, 5.3 | 2.4-2.9 | EXAM 3 | Crypt #5 |
| Jan. 27 | 5.4-5.5 | 4.1, esp.
pp. 254-260 | Solving incomplete columnar transpositions
Extended Euclidean algorithm | makeup |
| Jan. 28 | 4.3-4.4 | Public key cryptography
RSA cryptosystem | HW 13, 14 | |
| Jan. 29 | Student presentations
RSA wrap-up Exam 4 review What to do after MCS 223 | Crypt #6
Your Exam 4 questions & answers | ||
| Jan. 30 | Student presentations
EXAM 4 (optional) | Reports |