TMA4160 Cryptography - Fall 2022
|Visiting hours:||Fridays||14:00-15:00||836 in SBII|
|Exam:||29.11.2022, see here|
This semester will be similar to the one in 2021. But this time we will experiment a new way how to explain public-key cryptography and introduce programming exercises to reflect the practices of cryptography
Form of lecturing: Slides (mostly for symmetric crypto) and blackboard for the rest.
Questions and FAQ
Our FAQ is here. It may answer your question before you send it out.
There is also a Discussion Forum in Blackboard. You may find answer there.
You should be familiar with basic abstract algebra such as groups, rings and fields.
You will find the lectures more interesting or enjoyable if you know something about computational complexity and the analysis of algorithms.
For the programming exercises, we require knowledge about Python.
We will follow the lecture notes from Boneh and Shoup: https://toc.cryptobook.us/book.pdf. It is available online.
We might have some supplements, but we will state it in the lecture plan.
- Cryptography Made Simple, by Nigel P. Smart, Springer. Since NTNU has the Springer database, you can download it from here.
- Introduction to Modern Cryptography, 2nd edition, by Jonathan Katz and Yehuda Lindell.
- 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 of Boneh and Shoup (and possibly the supplements).
The curriculum is defined to be the material covered by the lecture notes, the lectures and the exercises.