| Lectures, Assignments, and Exams, Spring 2003 | ||||
| Week | Dates | Lecture Topics | Textbook Chap.Sect |
Exams Assigns |
| 1 | Jan 13, 15, 17 | Course Organization Introduction and Orientation Logarithms Coding and Information Theory Entropy and Huffman coding Shannon's Noiseless Coding Theorem |
Foreword Introduction 1.2 3 5 5 |
|
| 2 | Jan 22, 24
(Jan 20: MLK) |
Entropy, Channel Capacity Shannon's Noisy Coding Theorem |
3 4 |
|
| 3 | Jan 27, 29, 31 | Decimal errors (brief) Groups, Integers mod n Dihedral Group Verhoeff's Decimal Method |
7.1, 7.2 (brief) 1.3 8.2 8.3 |
|
| 4 | Feb 3, 5, 7 | Cryptograms, crypto terminology Exclusive-or Caesar, Beale ciphers |
9 1.1 10.1, 10.2 |
|
| 5 | Feb 10, 12, 14 | One-time pad, perfect crypto Random number generation |
10.3 16 |
Homework 1
Due Feb 10 |
| 6 | Feb 17, 19, 21 | Block ciphers Attacks and modes of operation |
11.1 11.2, 11.3, 11.4 |
|
| 7 | Feb 24, 26, 28 | Fields, integers mod p Public key distribution systems ssh |
1.4 12 |
Project 1
Due 28 Feb |
| 8 | Mar 3, 5, 7 | Fermat's, Euler's theorems Public key cryptography |
1.5 13 |
|
| 9 | Mar 10, 12, 14 (Mar 14: Last drop) |
Review, Mid-term Exam leeway |
Mid-term Exam (Review) |
|
| Spring Break, Mar 17-22 | ||||
| 10 | Mar 24, 26, 28 | RSA Public key cryptosystem Rabin's variation |
14 15 |
|
| 11 | Mar 31, Apr 2, 4 | Use of log tables Bit twiddling in Java Finite fields, GF(256) |
Appendix A Appendix B 20 |
|
| 12 | Apr 7, 9, 11 | Advanced Encryption Standard | 19, 21, 22, 23, 24 | |
| 13 | Apr 14, 16, 18 | Passwords Zero knowledge Identification |
25 26 27 |
|
| 14 | Apr 21, 23
(Apr 25: B of F) |
Threshold schemes | 28 | Homework 2
Due 23 April |
| 15 | Apr 28, 30
(May 1, 2: Study) |
Randomization | Project 2 | |
| May 7, 8:00 am | Final (Review ) |
|||
Notes:
Revision date: 2003-01-11.
(Please use ISO 8601,
the International Standard Date and Time Notation.)