CS 410/585 Cryptography - Fall 1998
Instructor
Description
The field of cryptology can be divided into two disciplines,
cryptography, which focuses on the design of cryptosystems or
the encoding of information so that it may be securely transmitted,
and cryptanalysis, which studies the breaking of cryptosystems.
We will focus on cryptography but always with regard to cryptanalysis.
A brief overview of classical systems continued with a in depth
examination of several modern cryptosystems will be presented. This
will include symmetric cryptosystems such as DES and
public-key cryptosystems specifically focusing on RSA.
A background in number theory will not be presumed; appropriate
material will be presented. Additional topics may include authentication
schemes, pseudo-random number generation,
one-way functions and secure protocols.
Prerequisites
CS252 Computational Structures
Course materials
Textbook:
Cryptography, Theory and Practice,
by Douglas R. Stinson,publisher: CRC Press
Book on Reserve: Applied Cryptography
by Bruce Schneier, publisher: John Wiley and Sons
Grading
Midterm and final are close-book, and
worth 30% and 35% of the final grade.
Assignments and projects are 35% of the grade.
Topical Course Outline and Reading
Chapter 1: Classical Cryptography
Chapter 2: Shannon's Theory, breifly, skip 2.2.1
Chapter 3: The Data Encryption Standard
Chapter 4: The RSA System and Factoring
Chapter 5: Other Public-key Cryptosystems, 5.1 only
Chapter 6: Signature Schemes, skip most of 6.4 - 6.6
Chapter 7: Hash Functions, skip 7.4, 7.5
Chapter 8: Key Distribution and Key Agreement, skip 8.4.2, 8.4.3
Chapter 9: Identification Schemes, skip 9.3, 9.4
Chapter 10: Authentication Codes 10.1 only
Chapter 11: Secret Sharing Schemes 11.1 only
Chapter 13: Zero-knowledge Proofs 13.1 - 13.3 only
Chapter 5: Other Public-key Cryptosystems, 5.2 only
Last Updated: Mon Sept. 21, 1998