The objective of this course is to familiarize the students
with cryptography and its applications. Topics will include
historical cryptography, encryption, authentication , public
key cryptography, number theory.
This class will focus on understanding the theoretical underpinnings of cryptography. Key components of this course are understanding how to precisely formulate security definitions and how to rigoursly prove theorems. This course is designed to be a challenging theory course. A good background and comfort in classes such as CS331 is important. A large component will be problems sets. These sets are meant to develop problem solving skills.
|Logistics|| Class Timing: Monday, Wednesday 8:30 - 10:00
Class Location: GDC 1.304
Office: GDC 6.810
Office Hours: Monday after class
Office (for office hours): GDC 1.302, Desk TBA
Office Hours: Thursday, Friday 12-1.
|Grading Policy|| Problem sets - 45%
In class examinations - 45%
Class participation - 5%
Research investigation 5%
|Course Information and Links||Problem set solutions must be written up in
Latex. Here is a guide
for doing so.
A set of course notes were taken by in 2010 and 2012. The material and the way it is presented has naturally evolved over time, however, much of it is similar and these can serve as a supplement to a student's own notes.
Number theory handout (from Dan Boneh) (1) (2)
|Piazza and Canvas||We will use piazza for class discussions, and homeworks/grades/announcements will be posted on Canvas. Please update your notification settings on Canvas, if required.|