Lectures:

• Thursdays, 14:10-15:40; Campus 2.2.08
• Thursdays, 15:50-17:20; Campus 2.1.08

Resources:

• Green sheet
• Programming assignment turn-in procedure:
  Send all required files as attachments to the instrutor via e-mail.

Handouts:

• Papers and their online presentations

1. Security Pitfalls in Cryptography. Bruce Schneier.
2. Randomness Recommendations for Security. Eastlake, Crocker, Schiller.
3. Time-lock Puzzles and Timed-Release Crypto. Ronald Rivest.
4. Cracking DES. Electronic Frontier Foundation
5. SDSI. A Simple Distributed Security Infrastructure. Ronald Rivest, Butler Lampson.
   Presentation by Mark Dietz (zip)
6. General Certificates. Martin Roescheisen.
7. Can We Eliminate Certificate Revocation Lists? Ronald Rivest.

• Homework 4 (pdf)
  Due: Thursday, Juli, 26, 2001 (at the beginning of class).

• Homework 3 (pdf)
  Due: Thursday, Juli, 12, 2001 (at the beginning of class).
  • Sample Makefile for DHRSACLient
  • Sample execution of protocol
  • Other possible values for RSA testing

• Homework 2 (pdf)
  Due: Thursday, June, 21, 2001 (at the beginning of class).

  Ronald L. Rivest Chaffing and Winnowing: Confidentiality without Encryption, MIT Media Lab, March 1998.

  • Input hash files (seed x₀): src1.dat, src2.dat, and src3.dat.
  • Initialized output files: dst1.dat, dst2.dat, and dst3.dat.
  • Makefile

• Homework 1 (pdf)
  Due: Thursday, May 31, 2001 (at the beginning of class).
  • Test files:
    test0.in,
    test1.in,
    test2.in (binary - 7bit),
    test3.in (empty),
    test4.in (binary - 8bit),
    test5.in.
  • Rotors:
    Identity rotor: rotora.dat (good for debugging)
    Symmetric rotor: rotorb.dat (good for debugging)
    Random rotor: rotorc.dat
    Random rotor: rotord.dat
    Random rotor: rotore.dat
    Random rotor: rotorf.dat
    Random rotor: rotorg.dat
    Random rotor: rotorh.dat
    Random rotor: rotori.dat
    Random rotor: rotorj.dat
    Random rotor: rotork.dat
    
  • Makefile (contains a few test case definitions)
  • Output files for the test cases above:
    test0a.out, test0b.out,
    test1a.out, test1b.out,
    test2a.out, test2b.out,
    test3a.out, test3b.out (both empty),
    test4a.out, test4b.out,
    test5a.out, test5b.out,
    

• Homework 0: Simple polyalphabetic cipher (pdf)
  Due: Thursday, May 17, 2001 (at the beginning of class).
  • Test files: test0.in, test0.out, test1.in, test1.out, test2.in, test2.out,

• Greatest Common Divisor computation - Example assignment and solution (ps,pdf).
  • Example assignment
  • Example solution in the Java (TM) Programming Language
  • Example Java Makefile
  • Example solution in C
  • Example C Makefile