CS 255 Course Overview
This course is an introduction to the basic theory and
practice of cryptographic techniques used in computer security. We will cover
topics such as
encryption (secret-key and public-key),
electronic commerce (anonymous cash, micropayments),
pseudo-random bit generation,
The course requires a basic understanding of probability
theory. Some knowledge of modular arithmetic will be helpful
but not required. The course is intended for advanced undergraduates
and graduate students.
We will be using two books:
and research papers handed out in class.
- Cryptography Theory and Practice by D. Stinson.
- Network Security by C. Kaufman, R. Perlman and M. Speciner.
There will be four homework assignments two of which will include
You may collaborate when solving the assignments, however when writing up
the solutions you must do so on your own.
- You must hand in all four homework assignments.
- Some of the homework assignments will contain extra credit questions.
You must solve extra credit questions on your own.
- Homework assignments will be graded on a scale of 0 to 10.
- Assignments must be handed in on the due date.
There will be a final exam. No midterm exam.
Your final placement in the class will be determined by the follwing
0.6 H + 0.4 F
- H is your average score on the four homework assignments.
- F is your final exam score.
Last update: Dec, 21, 1997