T. Ratliff Home  |  Math Home  |   Wheaton Home

Daily Syllabus - Math 302 Advanced Cryptography - Spring 2017

Be sure to check back, because this will be updated during the semester.

  • All chapter references are to the text An Introduction to Mathematical Cryptography by Hoffstein, Pipher, and Silverman.
  • See Detailed Reading Assignments for the specific topics in the text to focus on for each day.
  • See Problem Sets for the specific assignments.
Monday Wednesday Friday
1/25 Welcome to Math 302!
1.2 Divisibility and Greatest Common Divisors
1/27 1.3 Modular Arithmetic
1/30 1.4 Prime Numbers, Unique Factorization, and Finite Fields
1.5 Powers and Primitive Roots in Finite Fields
2/1 1.7 Symmetric and Asymmetric Ciphers
2.3 Diffie-Hellman Key Exchange
Problem Set due @ 3:00 pm
2/3 2.4 The Elgamal Public Key Cryptosystem
2.5 An Overview of the Theory of Groups
2/6 2.5 An Overview of the Theory of Groups
Cryptanalysis Challenge #1 due @ 3:00 pm
2/8 2.6 How Hard is the Discrete Logarithm Problem?
Problem Set due @ 3:00 pm
2/10 2.6 How Hard is the Discrete Logarithm Problem?
2/13 2.7 A Collision Algorithm for the DLP 2/15 2.8 The Chinese Remainder Theorem
Problem Set due @ 3:00 pm
2/17 2.9 The Pohlig-Hellman Algorithm
2/20 5.4 Collision Algorithms and Meet-in-the-Middle Attacks 2/22 5.5 Pollard's ρ Method
Problem Set due @ 3:00 pm
2/24 5.5 Pollard's ρ Method
Cryptanalysis Challenge #2 due @ 5:00 pm
2/27 5.5 Pollard's ρ Method 3/1 3.2 The RSA Public Key Cryptosystem
Exam 1 @ 6:00 pm
3/3 3.4 Primality Testing
3/6 3.4 Primality Testing 3/8 Finding Primes for the Digital Signature Algorithm
Problem Set due @ 3:00 pm
3/10 Student Presentation, Thursday, 3/9 @ 4:00 pm
3/13 Spring Break 3/15 Spring Break 3/17 Spring Break
3/20 6.1 Elliptic Curves 3/22 6.2 Elliptic Curves over Finite Fields
Problem Set due @ 3:00 pm
3/24 6.3 The Elliptic Curve Discrete Logarithm Problem
3/27 6.3 The Elliptic Curve Discrete Logarithm Problem 3/29 6.4 Elliptic Curve Cryptography
Problem Set due @ 3:00 pm
3/31 6.5 The Evolution of Public Key Cryptography
4/3 7.3 A Brief Review of Vector Spaces 4/5 7.4 Lattices: Basic Definitions and Properties
Problem Set due @ 3:00 pm
4/7 7.4 Lattices: Basic Definitions and Properties
4/10 7.5 Short Vectors in Lattices 4/12 7.6 Babai's Algorithm

Problem Set due @ 3:00 pm
4/14 Student Presentation, Thursday, 4/13 @ 4:00 pm
Kryptos Challenge opens on 4/13
4/17 7.6 Babai's Algorithm 4/19 7.8 The GGH Public Key Cryptosystem
Kryptos writeup due @ 3:00 pm
4/21 2.10 Rings, Quotients, Polynomials, and Finite Fields
4/24 7.9 Convolution Polynomial Rings 4/26 7.10 The NTRU Public Key Cryptosystem
Exam 2 @ 6:00 pm
4/28 7.10 The NTRU Public Key Cryptosystem
5/1 7.11 NTRUEncrypt as a Lattice Cryptosystem
Student Presentation, Tuesday, 5/2 @ 3:30 pm
5/3 7.13 Lattice Reduction Algorithms 5/5 7.13 Lattice Reduction Algorithms
Final Exam
Wednesday, May 10, 9:00 - 12:00


Maintained by: ratliff_thomas@wheatoncollege.edu