Introduction to Cryptography
Cryptography has become an indispensable tool for protecting information in computer systems. This course explains how to correctly use cryptographic primitives as well as their inner workings.
|Lectures:||Monday, Wednesday, 12:50-2:05pm, Gates B01|
|Questions for TAs:||email@example.com|
|Newsgroup:||su.class.cs255 (for discussion with TAs and other students)|
Students may take the final at either one of the following two dates:
- Option 1: (scheduled) Monday, 3/16, 9:00-11:00am, Gates B01.
- Option 2: (alternate) Tuesday, 3/17, 12:15-2:15pm, Gates B03.
For remote SCPD students: Please email cs255ta@cs with your email address, the email address of your SCPD monitor if you have one, and which day you would like to take the exam. We will email a pdf to you which you should print, complete, and fax back to us at 650 725-4671. Also email us when you fax the exam back so we can be on the lookout for it. We will email you with confirmation of receipt so hold on to your exam until you receive confirmation. Note that if you are local to the bay area, you must come to one of two exam slots unless you contact us in advance.
Due: Jan. 28, in class
Due: Feb. 18, in class
Due: Mar. 4, in class
milestone #1: due Jan 21, 11:59pm milestone #2: due Feb 11, 11:59pm
Due: Mar. 11, 11:59pm
- PRP-PRF lecture slides: [pdf]
- Basic number theory fact sheet I, primes: [pdf]
- Basic number theory fact sheet II, composites: [pdf]
- A Primer on number theory for computer scientists: [pdf]
- The RSA trapdoor permutation slides: [pdf]
- Previous final exams: 2001.pdf , 2002.pdf , 2003.pdf , 2004.pdf , 2005.pdf , 2006.pdf , 2007.pdf , 2008.pdf.