## Algorithms for Numbers and Public-Key Cryptography

**Professors**: Jean-Sébastien
Coron

The goal of the course is to learn the basics of computational number theory and public-key cryptography.

The course takes place in room MSA 3.190.- Wednesday, February 20th, 2019, 14:00-16:30

Course: Euclid's algorithm, Chinese Remainder Theorem, Modular arithmetic.

Exercise: Simple exercises. - Wednesday, March 6th, 2019, 14:00-16:30

Course: Computing with large integers

Exercise: Implementation of addition and multiplication for large integers. - Wednesday, March 13th, 2019, 14:00-16:30

Course: the RSA algorithm

Exercise: implementation of RSA - Wednesday, March 20th, 2019, 14:00-16:30

Course: Attacks against RSA: Coppersmith's technique

Exercise: applications of Coppersmith's technique. - Wednesday, March 27th, 2019, 14:00-16:30

Course: discrete-log based cryptography

Previous years: