TMA4160 Cryptography - Fall 2016
|Friday||12.15-14.00|| B2 (map) (except for October 14 which will be in B22)
|Exercises:||Wednesday||13.15-14.00||Usually in K26, sometimes in Nullrommet (380A)|
|Visiting hours:||Tuesday||14.15-15.00||848 in SBII|
What you should know before taking the course
You should be familiar with basic abstract algebra such as groups, rings and fields.
It is helpful, but not required, to know something about computational complexity and the analysis of algorithms. Using a computer algebra system (or equivalent) is required for some of the exercises. Previous experience with computer algebra systems is helpful, but not required.
- These notes follow the lectures fairly closely, but will be updated throughout the course.
- Cryptography, Theory and Practice, 3. edition, by Douglas R. Stinson.
- Handbook of Applied Cryptography by Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone.
- A Computational Introduction to Number Theory and Algebra by Victor Shoup.
You should be able to get by with just the lecture notes (and possibly the supplements), but many of you will find Stinson useful.
The curriculum is defined to be the material covered by the lecture notes, the lectures (except lattice-based cryptography) and the exercises.