Computer Science 420:

Fall 2005 web page. Here you can find all manner of information relating to CS420. Note: this web page is still under construction!

Announcements

Office hours on Wednesday, 4-6pm, will be held in James Blair room 215 from now on. Problem set 2 is now posted. Reminder: it is due 9/20/05, a correction from the printed version. Minor correction to the number theory exercises: In #62, the formula should be based on $m$ and $n$. See the "Other Information" section for recommended reading.

Contact Information

Instructor:   Moses Liskov,  mliskov@cs.wm.edu
Office:       McGl 135

Moses' office hours are Wednesdays, 4-6pm and Mondays, 12pm-2pm.

Handouts

Course Information
Number Theory Exercises
Problem Set 1 (due 9/8/05)
Problem Set 2 (due 9/20/05)
Problem Set 3 (due 10/4/05)
GM Security Proof (PDF) - (TEX)
Problem Set 4 (due 10/13/05)
Problem Set 5 (due 10/25/05)
Problem Set 6 (due 11/03/05)
Problem Set 7 (due 11/17/05)
Problem Set 8 (due 12/01/05)

Templates

Use these .tex files to make your life easier when writing up scribe notes or problem sets.

Lecture Notes

August 26th (LaTeX) - (PDF) by Elizabeth Crump
September 8th (LaTeX) - (PDF) by Justin Manweiler lec2.eps
September 13th (LaTeX) - (PDF) by Michael Holroyd
September 15th (LaTeX) - (PDF) by Hakan Seyalioglu
September 20th (LaTeX) - (PDF) by Andrew Haggard
September 22nd (LaTeX) - (PDF) by Jon Miller
September 27th (LaTeX) - (PDF) by Liz Crump
September 29th (LaTeX) - (PDF) by Ruth Lamprecht
October 4th (LaTeX) - (PDF) by Philip Shing
October 6th (LaTeX) - (PDF) by Justin Kliger
October 13th (LaTeX) - (PDF) by Michael Holroyd PRF1.eps PRF3.eps PRF2.eps
October 18th by Danny Cogut
October 20th (LaTeX) - (PDF) by David Bigelow ECBMode2.eps CBCMode2.eps (from Wikipedia -- see notes for reference.)
October 25th by David Goldenberg
October 27th by ??
November 1st by Dan DeSmet
November 3rd by Liz Crump
November 8th by Ruth Lamprecht
November 10th by Justin Kliger
November 15th by David Goldenberg
November 17th by Philip Shing
November 22nd by ??
November 29th by ??
December 1st by ??

If you want to claim one of the unclaimed dates, email the professor.

Projects

A list of project topics, with who has currently claimed them:

The Quadratic Sieve: A Factoring Method (David B.) [various]
Elliptic Curves in Cryptography (Hakan and Justin M.) [various]
RSA-OAEP: Using RSA securely (Dan) [paper]
The Paillier Cryptosystem (unclaimed) [paper]
The Cramer-Shoup Cryptosystem (unclaimed) [paper, see also notes from previous course (below)]
Blind Signatures for Electronic Cash [See "Blind Signatures for Untraceable Payments" by Chaum, Rivest, and Sherman, proceedings of Crypto '82, and this paper]
Ring Signatures (Michael) [paper]
Group Signatures (Andrew) [See "Group Signatures" by Chaum and Heyst, proceedings of Eurocrypt '91]
Forward-Secure Signatures (Liz) [paper]
Schnorr Signatures (unclaimed) [See "Efficient Identification and Signatures for Smart Cards" by CP Schnorr, proceedings of Crypto '89, and journal version "Efficient Signature Generation by Smart Cards", Journal of Cryptology 1991]
Fiat-Shamir Signatures (David G.) [paper]
Secret Sharing and its Applications (Danny and Philip) [See "How to Share a Secret" by A. Shamir, available here, and this paper]
Non-Interactive Zero Knowledge (unclaimed) [paper -- use unix command "gunzip" to extract .ps file]
Yao's Secure Circuits (unclaimed) [See "How to Generate and Exchange Secrets (Extended Abstract) by Andrew Chi-Chih Yao, in proceedings of FOCS (Foundations of Computer Science) 1986]
Goldreich-Levin Theorem: Hard-Core Bits from all OWFs (unclaimed) [paper]
HILL Theorem: PRGs from any OWF (unclaimed) [paper]
Luby Rackoff 3-Round Ciphers are Secure (unclaimed) [paper]
Design of AES (Ruth) [paper]

Other Information

Here are some recommended readings:

Bellare and Goldwasser's lecture notes on cryptography. This covers much of the material we'll be covering, in a rigorous way with slightly different notation. A good reference.
Cryptography course notes from when I TA'd the course at MIT. The lecture notes, especially, should be helpful.
Ed Schaefer's notes on cryptography are available on the web. His treatment of cryptography will NOT be much like mine, however, his notes have a reasonable treatment of number theory.
This site includes some number theory tutorials you may find useful.

talks