Introduction to Computer and Network Security - Wintersemester 2002/2003 - Uni Heidelberg

Universität Heidelberg
Fakultät für Mathematik und Informatik
Institut für Informatik

Introduction to Computer and Network Security - Wintersemester 2002/2003

Course Policies:

Green sheet Start here!

Lectures:

Thursdays, 9:00-10:30 (sine tempore)
Im Neuenheimer Feld 348, Room 013

*Date*	*Topics*
Oct., Nov. 17 2002	Organizational announcements: green sheet, example prg. assignment, turn-in procedure, overview over syllabus
Thu., Oct. 17, 24 2002	Introduction to the Computer Security Problem
Thu., Oct. 31 2002	Introduction to Cryptography and Cryptosystems
Thu., Nov. 7 2002	Introduction to Cryptography and Cryptosystems (cont.)
Thu., Nov. 14 2002	Product Ciphers - The Data Encryption Standard
Thu., Nov. 21 2002	Introduction to Information Theory
Thu., Nov. 21, 28 2002	Introduction to Number Theory
Thu., Dec. 19 2002	Exponentiation Cryptosystems
Thu., Jan. 9, 16 2003	Key Distribution
Thu., Jan. 23, 30 2003	Kerberos
Thu., Feb. 6 2003	Firewall Systems

Homework Assignments:

Homework 3 (pdf)
Due: Thursday, Jan. 30, 2003 (at the beginning of class).
- Homework 3 packaged: tar archive
- Code snipped byteArrayToHexString
- Makefile
- Initialized output files for SKey for seeds below: dst1.dat, dst2.dat, and dst3.dat.
- Input hash files (seed x₀): src1.dat, src2.dat, and src3.dat.

Homework 2 (pdf)
Due: Thursday, Dec. 19, 2002 (at the beginning of class).
- Sample Makefile for DHRSACLient
- Sample execution of protocol
- Other possible values for RSA testing

Homework 1 (pdf)
Due: Thursday, Nov. 28, 2002 (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: Thursday, Nov. 7, 2002 (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

Christoph L. Schuba