Problem Sets, Math 202 Cryptography, Fall 2024

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

The Problem Sets are normally due on Fridays at 12:30 pm, submitted as a single pdf file to Canvas. Check the Tentative Daily Syllabus for the schedule of all assignments. Each Problem Set will be posted here at least one week before the due date.

Remember to follow the Guidelines for Problem Sets in writing up your solutions.


Problem Set #1, Due Friday September 6 @ 12:30 pm
Chapter 1: 1.2, 1.8, 1.11, 1.12, 1.16
Problem Set #2, Due Friday September 13 @ 12:30 pm
Chapter 3: 3.14
Note that you'll need to look up an ASCII table to see understand the exact options for the keys. Also see video on Canvas for clarification on the least significant bit.
Problem Set #3, Due Friday September 20 @ 12:30 pm
Chapter 4: 4.5, 4.6, 4.7, 4.14
For 4.5, 4.6, and 4.7 do the computations by hand, although you may use Table 4.2 to look up the inverse in 4.6. You may also use Mathematica to verify your answers.
Problem Set #4, Due Friday September 27 @ 12:30 pm
Chapter 6: 6.2
Chapter 7: 7.2, 7.3, 7.4
Problem Set #5, Due Friday October 18 @ 12:30 pm
Problem Set #5 and the Mathematica notebook with values for Question 3
Problem Set #6, Due Friday October 25 @ 12:30 pm
Chapter 8: 8.2, 8.4, 8.5, 8.6, 8.10
It's ok to use the Mathematica command MultiplicativeOrder[ ] in these problems.
Problem Set #7, Due Friday November 8 @ 12:30 pm
Chapter 8: 8.8
Chapter 10: 10.5, 10.14
Supplemental (but not optional!) problems for Problem Set #7: Complete the In-Class work from Nov 4 on certificate authorities and include it with your Problem Set