Stanford

CS255
Introduction to Cryptography

Winter 2003

  

Administrative

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:   cs255ta@cs.stanford.edu

Final

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

  

 Option 1:   Thursday, 3/20,  12:15- 2:15pm,   Terman Aud.

 Option 2:  Wednesday, 3/19,  12:15- 2:15pm,   320-105.

Homework

  

Homework #1: ps, pdf.         Solutions: pdf

Due: Feb. 5th, 2003. In class.

  

Homework #2: ps, pdf.         Solutions: pdf

Due: Feb. 19th, 2003. In class.

  

Homework #3: ps, pdf.         Solutions: pdf

Due: Mar. 3rd, 2003. In class.

Projects

  

Project #1: ps, pdf.     Starter code.

Due: Feb. 26, 2003.

  

Project #2: pdf.     Starter code.

Due: Mar. 10, 2003.

Handouts

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

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