CS 668 A - Foundations of Cryptography

This course provides a broad introduction to cornerstones of security (authenticity, confidentiality, message integrity, and non-repudiation) and the mechanisms to achieve them. Topics include: block and stream ciphers, public key cryptosystems, key management, certificates, public key infrastructure (PKI), digital signatures, non-repudiation, and message authentication. Various security standards and protocols such as DES, AES, PGP, and SSL are also discussed.

Pre-requisites:

• CS/MA 503 (Discrete Mathematics for Cryptography) and either CS 600 (Data Structures and Algorithms) or CS 434 Theory of Computation
• or permission of the instructor

Textbook:

Douglas Stinson
Cryptography: Theory and Practice
CRC Press
ISBN 1-58488-206-9
Errata List

Other Resources:

• Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone
  Handbook of Applied Cryptography
  CRC Press
  ISBN 0-8493-8523-7
  Available online - for free!

• Victor Shoup
  A Computational Introduction to Number Theory and Algebra
  Cambridge University Press
  ISBN 0521851548
  Available online - for free!

• Howard M. Heys
  A Tutorial on Linear and Differential Cryptanalysis

Instructor:

Dr. Susanne Wetzel (swetzel AT cs DOT stevens DOT edu)
Office hours: Wednesdays 04:00 PM - 06:00 PM and by appointment. Lieb Building 304.

Bart Luczynski (bluczyns AT cs DOT stevens DOT edu)
Office hours: Mondays 04:00 PM - 06:00 PM and by appointment. Burchard Building 127 (TA Room).

10% class participation, 40% homework assignments (10% each), 20% midterm, 30% final

Policies:

• A make-up midterm/final will be granted only if the instructor is notified before the exam and there is serious illness or similarly important reason for missing the exam.
• For fairness to all students there will be no individual extra credit work.
• Homework assignments are due before the lecture begins. Late submissions will NOT be accepted. Exceptions may be granted only if there is an important reason for late submission. Exceptions must be cleared with the instructor in advance. If you must miss a class at which an assignment is due, you may email your solution to the TA postmarked BEFORE it is due.
• You may collaborate on homeworks with your fellow students to a limited degree. I.e., you may discuss concept clarifications with other students, but the specific details of your homeworks must be your own work.
• You must specify in writing any resources (web, books etc.) other than the textbook that you used for completing the assignments.
• It is cheating to collaboratively work out a detailed solution, to copy a solution from another student or some other resource without specifying it, or to give away a solution.
• ALL parties involved in a case of cheating get an automatic grade of zero (0) in the assignment/exam. Repeated cases get an F in the course. Any case of cheating will be reported to the honor board or the Dean of the Graduate School.

Week	Date	Topics	Reading	Remark
1	August 29, 2005	Introduction, Classical Cryptography	Chapter 1
2	September 5, 2005	No Class - Labor Day
3	September 12, 2005 3:15 PM - 5:45 PM	Classical Cryptography cont'd, Information Theory	Chapter 2
4	September 19, 2005	Block Ciphers	Chapter 3
5	September 26, 2005	Modes of Operation
6	October 3, 2005	AES, Hash Functions	Chapter 4
7	October 11, 2005 Monday Schedule	Hash Functions cont'd, Message Authentication Code
8	October 17, 2005	MACs cont'd, Public Key Encryption: Introduction	Chapter 5
9	October 24, 2005	Midterm Exam
10	October 31, 2005	Public Key Encryption: Diffie-Hellman, ElGamal	Chapter 6
11	November 7, 2005	Public Key Encryption: Additional Topics
12	November 14, 2005	Digital Signatures	Chapter 7
13	November 21, 2005	Digital Signatures cont'd
14	November 28, 2005	Key Management
15	December 5, 2005	Final Exam