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

The Problem Sets are normally due on Thursdays at 11:59 pm. 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 Thursday September 8 @ 11:59 pm

Chapter 1: 1.2, 1.9, 1.10, 1.14

Problem Set #2, Due Thursday September 15 @ 11:59 pm

Chapter 3: 3.12

Note that you'll need to look up an ASCII table to see understand the exact options for the keys. Also see video on onCourse for clarification on the least significant bit.

Note that you'll need to look up an ASCII table to see understand the exact options for the keys. Also see video on onCourse for clarification on the least significant bit.

Problem Set #3, Due Thursday September 22 @ 11:59 pm

Chapter 4: 4.5, 4.6, 4.16

For 4.5 and 4.6, do the computations by hand, although you may use Table 4.2 to look up the inverse, and you may use Mathematica to verify your answers.

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.5 and 4.6, do the computations by hand, although you may use Table 4.2 to look up the inverse, and you may use Mathematica to verify your answers.

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.