CS656 Cryptography
Spring 1999


Instructor: Christino Tamon
Office: SC373
Lecture: MWF 11am
Office hours: MW 9-11am, F 9-10am
Pre-requisites: MA211 or MA346 and a healthy mathematical curiosity.
Syllabus: Cryptography is the study of secure communication over insecure channels. We will study the basic methods and concepts in theoretical cryptography along with their applications. Concepts such as one-way functions and trapdoor permutations (functions that are easy to compute but computationally hard to invert), pseudorandom sequence generators (devices that produces sequences that are computationally random), public-key cryptosystems (secure systems that require no secret agreement), one-way hash functions (tools to authenticate messages and to verify data integrity), digital signatures (mechanisms for signing documents), and others. Most of the topics require background in number theory, probability theory, and abstract algebra. The first part of the course will be spent on developing the necessary background in these areas. The second part of the course is spent on developing the theoretical background behind the above topics. Finally the last part of the course will examine applications of the concepts in existing implementations.
Grading scheme
  • Assignments and Quizzes 40
  • Midterm(2) 30%
  • Final exam 30%
Required texts:
  • Schneier, Bruce. Applied Cryptography. John Wiley and Sons, Second edition, 1996.
Recommended references
  • Cormen, Leiserson, and Rivest. An Introduction to Algorithms. MIT Press.
  • Kernighan and Ritchie. The C Programming Language. Second edition. Prentice-Hall, 1988.

Links