# TMA4160 Cryptography - Fall 2020

Lecturer: | Jiaxin Pan | ||
---|---|---|---|

Assistant: | Shuang Wu | ||

Schedule | Room | ||

Lectures: | Thursday | 12:15-14:00 | see the schedule |

Friday | 10:15-12:00 | ||

Exercises: | Wednesday | 16:15-17:00 | |

Visiting hours: | Thursday | 14:00-15:00 | 836 in SBII |

Exam: | 16.12.2020 |

## Messages

(Messages)

## Prerequisite

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. Using a computer algebra system (or equivalent) is required for some of the programming homework. Previous experience with computer algebra systems is helpful, but not required.

## Reference group

Deleted due to GDPR.

## Course material

**Changes**: Please note that this semester we will make changes to the previous lecture, namely, our curriculum will reflect basic concepts in modern cryptography. It will put more focus in cryptographic constructions (for instance, public-key encryption) and its proofs rather than cryptanalysis (for instance, algorithms for solving discrete logarithms). We will have a good balance between informal intuitions and formal definitions and proofs. We may also cover some interesting applied topics if there is time.

**Lecture notes**:
All our lectures are based on material available online, either the following notes or some additional notes (or slides) in our Blackboard system. It will be mentioned explicitly in the class and lecture plan.

- The previous lecture notes follow some of the lectures, but it mainly focuses on intuitions. It may be updated throughout the course.
- Some of our lectures will follow the notes from Boneh and Shoup as well. It is written in a more formal manner and in the style of modern cryptography.

Again, we will announce which contents a lecture is based on during the lecture, and we will state it in the lecture plan.

Supplements:

*Cryptography, Theory and Practice*, 4th edition, by Douglas R. Stinson. 3rd edition will also work. (We do**not**recommend it as our textbook anymore.)*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 (and possibly the supplements), but some of you may find Stinson or the book of Katz and Lindell useful. **Note that they do not cover the entire curriculum.**

The curriculum is defined to be **the material covered by the lecture notes, the lectures and the exercises.**