ECS 227 - Modern Cryptography - Spring 2007

This page last updated: 19 Jun 2007, 12:35 pm

Announcements

General Information

  • Lectures to date - grows with each class
  • Class notes - evolving course notes, co-written with Mihir Bellare.
  • Course information sheet - please read this and Lectures for 2005 - doubles as a syllabus, as topics this year will be similar
  • Class pictures - In living color
  • Project information - Projects are due the last day of class
  • sample.tex LaTeX file and the sample.pdf it yields (in case you've never used LaTeX)

    Problem Sets

  • PS 1 (due 23 April)
  • PS 2: Problems 3.1, 4.2, 4.9, and 4.10
  • PS 3: Problems 6.2 and this problem (due 9 June)

    Supplemental Material

  • Strong security bounds for permutations (Bernstein) (Section 2)
  • Stronger security bounds for Wegman-Carter-Shoup authenticators (Bernstein) (Theorem 4.2)
  • DES is not a Group (Campbell and Wiener) (describes Coppersmith's proof that is huge)

    Phil Rogaway's homepage