Math 116: Cryptography
Lecture
- Mon, Wed, Fri 9 – 9:50am in 4645 Geology
- Instructor: Hood Chatham
- Contact: hood@math.ucla.edu
- Office Hours: Thursday, 3pm – 5pm at my office
- Office: Math Sciences 6903
Discussion Section
- Thursday, 9 – 9:50am in 4645 Geology
- TA: Derek Levinson
- Contact: djlevins@math.ucla.edu
- Office Hours:
- Tuesday 11am – 12am on Zoom,
- Thursday 10am – 11am in MS 3975
Syllabus
The syllabus is here.
Textbook
Hoffstein, Pipher, Silverman, An Introduction to Mathematical
Cryptography, 2nd ed. We will be covering Chapters 1 – 4 and parts of 6 and
7. The textbook is freely available for download through
SpringerLink.
Getting Sage
I wrote some instructions for getting Sage here.
Homework
- Homework 1 due Friday, April 8th
- Homework 2 due Friday, April 15th
- Homework 3 due Friday, April 22th
- Homework 4 due Friday, April 29th
- Homework 5 due Friday, May 13th
- Homework 6 due Friday, May 20th
- Homework 7 due Friday, May 27th
- Homework 8 due Friday, June 3rd
Lecture Videos
These are available here.
Lecture Notes
- Lecture 1: Intro to Cryptography, § 1.1
- Lecture 2: Divisibility and GCD, the Extended Euclidean Algorithm, § 1.2
- Lecture 3: Modular arithmetic, § 1.3
- Lecture 4: Finite fields, § 1.4 & 1.5
- Lecture 5: Formalism of cryptosystems, § 1.7
- Lecture 6: The Discrete Log Problem & DIffie-Hellman Key Exchange, § 2.1 – 2.3
- Lecture 7: Elgamal Public Key Cryptography, § 2.4
- Lecture 8: How Hard is the Discrete Log Problem?, § 2.6 & 2.7
- Lecture 9: The Chinese Remainder Theorem, § 2.8
- Lecture 10: Pohlig–Hellman, § 2.9
- Lecture 11: RSA § 3.1 & 3.2
- Lecture 12: Primality Testing § 3.4
- Lecture 13: Factoring via Pollard's p-1 method § 3.5
- Lecture 14: Factoring via Difference of Squares method § 3.6 – 3.7.2
- Lecture 16: Quadratic Residues & Probabilistic Encryption § 3.9 – 3.10
- Lecture 17: Digital Signatures § 4.1 & 4.2
- Lecture 18: Elliptic Curves § 6.1
- Lecture 19: Elliptic Curves over finite fields § 6.2
- Lecture 20: Elliptic Curve Discrete Log Problem § 6.3 & 6.3.1
- Lecture 21: Elliptic Curves Cryptography § 6.4
- Lecture 22: Lenstra's Elliptic Curve Factorization § 6.6
- Lectures 23+24: Towards the equivalence of DHP and DLP § 6.2
- Lectures 25: Lattice Cryptography 1
- Lectures 26: Lattice Cryptography 2
- Lectures 27: Lattice Cryptography 3