## 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 A14.- Friday, February 24th, 2017, 14:00-16:30

Course: Basics of C programming. Euclid's algorithm

Exercise: Simple exercises. Implementation of Euclid's algorithm. - Friday, March 3rd, 2017, 14:00-16:30

Course: Basics of C programming. Chinese Remainder Theorem. Computing with large integers.

Exercise: Implementations. - Friday, March 10th, 2017, 14:00-16:30

Course: Computing with large integers. Modular arithmetic.

Exercise: Implementation of large addition and multiplication. - Friday, March 24th, 2017, 14:00-16:30

Course: The RSA algorithm. Primality testing.

Exercise: Implementation of RSA light. Implementation of primality testing. - Friday, April 7th, 2017, 09:00 - 10:30

Course: Discrete-log groups and applications.

Exercise: Implementation of DL groups. - Friday, April 7th, 2017, 14:00-16:30

Course: Polynomial arithmetic and application to secret-sharing.

Exercise: Implementation of polynomial arithmetic.

Previous year: