TMA4160 Cryptography - Fall 2019
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.
|Sturla Frydenlund||sturla.frydenlund (at) gmail.com||BMAT|
|Oskar Holmstedt||uoholmst (at) stud.ntnu.no||Exchange student|
|Anna Bakkebø||anna.bakkeboe (at) gmail.com||LUR|
- These notes follow the lectures fairly closely, but will be updated throughout the course.
- Cryptography, Theory and Practice, 4th edition, by Douglas R. Stinson. 3rd edition will also work.
- 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. Note that Stinson does not cover the entire curriculum.
The curriculum is defined to be the material covered by the lecture notes, the lectures and the exercises.