Ring for service University of Washington Computer Science & Engineering
 CSE 599B Cryptography Winter 2006
  CSE Home   About Us    Search    Contact Info 

Problem Sets
  Problem Set 1
Lecture Notes
  Lecture 1 (Handwritten PDF)
  Lecture 1 (Latexed notes)
  Lecture 2 (Handwritten PDF)
  Lecture 3 (Handwritten PDF)
  Lecture 4 (Latexed PDF)
  Lecture 5 (Latexed PDF)
  Lecture 6 (Latexed PDF)
  Lecture 7 (Latexed PDF)
  Lecture 8 (Latexed PDF)
  Lecture 9 (Latexed PDF)
  Lecture 10 (Latexed PDF)
  Lecture 11 (Latexed PDF)
  Lecture 12 (Latexed PDF)
  Lecture 13 (Latexed PDF)
  Lecture 14 (Latexed PDF)
  Lecture 15 (Latexed PDF)

CSE 599B


  • Instructor: Paul Beame

  • Time: Wednesdays 12:00-12:50 & Fridays, 10:30am -- 12:20am.

  • Location: CSE 203

  • Course webpage: http://www.cs.washington.edu/599b

Cryptography sources:

Cryptography is an essential part of computer security but in many contexts it is treated as a black box with ill-specified or highly idealized properties.

For many cryptographic primitives the notions of security have indeed been formalized satisfactorily using notions from computational complexity and randomized algorithms. Furthermore, using reductions, researchers have shown how to develop cryptosystems whose security is precisely based on the intractibility of computing certain functions.

This course will examine the following questions:

  • What does it mean for cryptographic protocols to be secure?

  • How can we base secure cryptographic protocols on intractible problems?

  • What are some existing cryptographic protocols and how do they fit in this framework?

In particular we will study:

  • symmetric (private-key) and asymmetric (public-key) encryption

  • message authentication and signature schemes

  • cryptographic hash functions

  • pseudorandom number and pseudorandom function generation other topics as time permits (e.g. zero-knowledge proofs)

Work in the class will consist of note-taking (possibly), a small number of written assignments, and a final project that will involve reading and giving a presentation of a cryptography paper.

Prerequisite: Some familiarity with formal models of computation will be helpful

Talk Slides

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to Paul Beame]