International University Bruchsal Department of Information and Communication Technology

IT251 - Cryptographic Techniques - Winter 2003

Course Policies:

• Green sheet Start here!

Lectures:

• Wednesdays, 9:40-11:10; Campus 2.2.08
• Wednesdays, 11:20-12:50; Campus 2.2.08

Homework Assignments:

• Homework 3 (pdf)
  Due: Wednesday, April 2, 2003 (at the beginning of class).
  • Homework 1 packaged: tar archive

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

• Homework 2 (pdf)
  Due: Wednesday, Mar. 19, 2003 (at the beginning of class).

• Homework 1 (pdf)
  Due: Wednesday, Feb. 19, 2003 (at the beginning of class).

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

  • Homework 1 packaged: tar archive

  • 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 (pdf)
  Due: Wednesday, Feb. 12, 2003 (at the beginning of class).
  • Test files: test0.in, test0.out, test1.in, test1.out, test2.in, test2.out,

Papers:

• Whitfield Diffie Decrypting the Secret to Strong Security., C|Net News.Com: January 16, 2003.
• Ronald L. Rivest Chaffing and Winnowing: Confidentiality without Encryption, MIT Media Lab, March 1998.

Other Handouts:

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