Course Overview |
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. |
Syllabus |
Syllabus The syllabus has detailed information about the class including topic schedule and face-to-face instruction policy that is not on this webpage. Please read it. |
Logistics | Class Timing: Monday, Wednesday 9:30 - 11:00 Class Location: UTC 3.132 |
Professor | Brent Waters Email: bwaters@cs.utexas.edu Office: GDC 6.810 Office Hours: Monday, Wednesday 11-11:45 (immediately after class) Please alert instructor at end of class if attending |
TAs | Rachit Garg Email: rachg96@cs.utexas.edu Office (for office hours): GDC 1.302, Desk TBA Office Hours: Monday 4-5, Thursday 12-1. George Lu Email: gclu@cs.utexas.edu Office (for office hours): GDC 1.302, Desk TBA Office Hours: Tuesday 3-4, Friday 1-2. |
Grading Policy | Problem sets - 50%
In class examination - 15% Final examination - 25% 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 past years. 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. |