- Location and time
Class: MWF 10-10:50 am, MS 5117
Discussion: T 10-10:50 am, MS 5117
Office hours: M 5-6, W 11-12
Office hours: T 11-12, Th 10-11
Hoffstein, Pipher, Silverman: An Introduction to Mathematical Cryptography. Springer UTM, 2014.
Note: The textbook is freely available for download through SpringerLink. (You need to access the website from within the campus network, or use the UCLA proxy server.)
Weekly homework will be announced on ccle and the solutions will be collected on Fridays at the beginning of class. (The first homework set will be due on April 13.)
Working in groups could be a more efficient way of learning. You are permitted (and encouraged) to meet with other students in the class to study the material of the course and/or get help for the homework. However, the homework you turn in must be written by you in your own words.
- First midterm: April 27, 10 am, MS 5117
- Second midterm: May 18, 10 am, MS 5117
- Final exam: June 14, 8:00 am-11:00 am, MS 5117
There will be no make-up exams, neither for the midterms nor for the final. However, some flexibility is built into the system by having two grading schemes. Your overall final grade will be the best of the following two variants:
- 10% best 6 homeworks + 40% both midterms + 50% final.
- 15% best 6 homeworks + 25% best midterm + 60% final.
Letter grades will not be assigned until the end of the quarter, at which point your composite numerical score will be converted into a letter grade based on class ranking. Approximately a third of the class will receive grades in the A+/A/A- range, and another third of the class will receive grades in the B+/B/B- range (unless something surprising happens).
The final exam must be taken in order to receive a passing grade.
Regrades on midterms and homework must be requested within one week of the date those are returned. After this time, no requests for corrections will be honored.
All grades will be recorded on myUCLA.
This is a tentative schedule for the course:
M W F 1 syllabus, introduction; shift ciphers modular arithmetic affine ciphers 2 substitution ciphers Chinese Remainder Theorem homework 1; Hill cipher 3 symmetric ciphers complexity theory, encoding schemes homework 2; one-time pad 4 pseudo-randomness, asymmetric cryptography finite fields, exponentiation first midterm 5 discrete logarithms Diffie-Hellman homework 3; Elgamal 6 algorithms for discrete logarithms Euler's formula homework 4; RSA 7 RSA RSA attacks second midterm 8 primality testing factoring integers homework 5; digital signatures 9 holiday Hash functions homework 6; PGP, blind digital signatures 10 digital cash Bitcoin Bitcoin