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

The Problem Sets are normally due on Wednesdays at midnight. Each group will submit the written work as a single pdf through onCourse, and you may upload a Mathematica notebook if necessary. 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.

All chapter references are to the text Understanding Cryptography by Paar and Pelzl.

Problem Set #1, Due Wednesday September 2 @ midnight

Chapter 1: 1.2, 1.9, 1.10, 1.14

Problem Set #2, Due Wednesday September 9 @ midnight

Chapter 2: 2.4

Chapter 3: 3.12 (see video on onCourse for clarification)

Problem Set #3, Due Wednesday September 16 @ midnight

Chapter 4: 4.5, 4.6, 4.7, 4.16

For 4.16, be sure to check a physical copy of the text (I've had students with a pdf tell me the problem is different).

For Moore's law, use that processing time will double every 18 months.

For 4.16, be sure to check a physical copy of the text (I've had students with a pdf tell me the problem is different).

For Moore's law, use that processing time will double every 18 months.

Problem Set #4, Due Wednesday September 23 @ midnight

Chapter 4: 4.13

Mathematica notebook that may be
useful for one of the Supplemental problems

Problem Set #5, Due Wednesday October 14 @ midnight

Mathematica notebook containing some useful commands and the large values for RSA

Problem Set #6, Due Friday October 23 @ midnight

Chapter 8: 8.2, 8.4(parts 1-3), 8.6, 8.10

The Mathematica command MultiplicativeOrder[ ] may be useful for 8.4 part 3

The Mathematica command MultiplicativeOrder[ ] may be useful for 8.4 part 3

Problem Set #7, Due Friday November 20 @ midnight

Mathematica notebook containing the parameters and messages