Cryptography Section 50 - Calendar- Fall 2022

Last Updated: Friday, December 16 2022 at 11:47 AM
Be sure to check back often.

Monday

Wednesday

Friday

Aug. 29
Aug. 31
Lecture #1:
Introduction to Cryptography
Introduction of Classmates
Caesar Ciphers
Sept. 2
Lecture #2:
Cryptography Terminology
Monoalphabetic Substitution
Sept. 5
Labor Day
Sept. 7
Homework 1 Due
Lecture #3:
Monoalphabetic Substitution
Frequency Analysis Modular Arithmetic

Sept. 9
Lecture #4:
Minutes past the hour
Division Algorithm
Divisibility
Video: Vigenère Cipher

Sept. 12
Lecture #5:
Vigenère Example
Properties of Mods
Sept. 14
Homework 2 Due
Lecture #6:
Divisibility Lemmas
Affine cipher
Sept. 16
Quiz 1
Homework 1 and 2
Lecture #7:
Deciphering Affine
Sept. 19
Lecture #8:
Inverse Mod n
Video: Euclidean Algorithm
Video: Bezout's Theorem

Sept. 21
Homework 3 Due
Lecture #9:
GCD
Bezout and Inverses
Sept. 23
Lecture #10:
Finding inverses
Proof of Euclidean Algorithm

Sept. 26
Lecture #11:
Number of keys in Affine cipher
Euler Phi Function
Sept. 28
Homework 4 Due
Lecture #12:
Factoring
Speed of Algorithms
Breaking Affine Cipher
Sept. 30
Quiz 2
Homework 3 and 4
Lecture #13:
Known Plaintext attack on Affine
Introduction to Hill Cipher
Oct. 3
Lecture #14:
Hill Cipher
Decipher Hill

Oct. 5
Homework 5 Due
Lecture #15:
Matrices
Inverse of a Matrix
Mod 29
Video: Playfair Cipher

Oct. 7
Lecture #16:
Keywords and Playfair
Oct. 10
Lecture #17:
Breaking Hill
Oct. 12
Homework 6 Due
Lecture #18:
Rectangular Transposition
Oct. 14
Quiz 3
Homework 5 and 6
Lecture #19:
ADFGVX
Oct. 17
Lecture #20:
ADFGVX Example
Questions for Midterm
Oct. 19
Homework 7 Due
Exam #1
Topics: Caesar Cipher Through Rectangular Transposition
Oct. 21
Lecture #21:
International Center
Enigma
Vigenère Cipher Revisited
Oct. 24
Lecture #22:
Vernam Cipher
Change of Bases
Oct. 26
Homework 8 Due
Lecture #23:
Hexadecimal
ASCII

Oct. 28
Quiz 4
Homework 7 and 8
Lecture #24:
Vernam and ASCII

Oct. 31
Lecture #25:
Unicode
Introduction to Public Key
Nov. 2
Homework 9 Due
Lecture #26:
Euler's Theorem
Fermat's Little Theorem
Nov. 4
Lecture #27:
Successive Squaring

Nov. 7
Lecture #28:
Introduction to RSA
Nov. 9
Homework 10 Due
Lecture #29:
RSA Implementation
Examples in Groups
Nov. 11
Quiz 5
Homework 9 and 10
Lecture #30:
Signatures

Nov. 14
Lecture #31:
Hash functions
Nov. 16
Homework 11 Due
Lecture #32:
Signing Protocol
RSA with Big Numbers
Nov. 18
Lecture #33:
Real time communication
Primitive roots for a prime
Nov. 21
Lecture #34:
Diffie-Hellman Key Exchange
AES
Nov. 23
Thanksgiving Break
Nov. 25
Thanksgiving Break
Nov. 28
Class Canceled
Nov. 30
Homework 12 Due
Lecture #35:
Diffie-Hellman in groups
Dec. 2
Quiz 6
Homework 11 and 12
Lecture #36:
AES Protocol
Dec. 5
Lecture #37:
AES in groups
Dec. 7
Homework 13 Due
Integration Assignment

Lecture #38:
ElGamal
Dec. 9
Review in a Secret Location
Final Exam

Friday, December 16 at 11:00 AM.


Cryptography Home | C. Parker's Home