Introduction to Cryptography

Winter 2004


Course syllabus
Course overview - Grading, Textbooks, Course work, Exams.
Course Staff and office hours.

Lectures:     Monday, Wednesday, 2:15 - 3:30, Terman Aud.
Questions:   News group:  su.class.cs255.     TA mailing list:


Students may take the final at either one of the following two dates:

     Option 1:   Thursday, 3/18,  3:30-5:30pm,   SKILL 193
  Option 2:   Friday, 3/19,  12:15-2:15pm,   Terman Aud.

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 (thursday or friday). 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, you must come to one of two exam slots unless you contact us in advance.



Homework #1: ps, pdf.    solutions

Due: Jan. 28. In class.


Homework #2: ps, pdf.    Solutions: ps, pdf.

Due: Feb. 18. In class.


Homework #3: ps, pdf.    Solutions: ps, pdf.

Due: Mar. 1st. In class.


Homework #4: ps, pdf.    Solutions: ps, pdf.

Due: Mar. 12th. No late days.



Project #1: pdf, ps.    Starter code.

Due: Feb. 9.


Project #2: pdf.    Starter code.    presentation.

Due: Mar. 10.


Course syllabus
Notes from MAC lecture
Basic number theory fact sheet I: primes.
Basic number theory fact sheet II: composites.
RSA Lecture
A Primer on number theory for computer scientists.

Previous final exams:   1999.pdf ,   2000.pdf ,   2001.pdf ,   2002.pdf ,   2003.pdf.