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.
  1. Friday, February 20th, 2019, 14:00-16:30
    Course: Euclid's algorithm, Chinese Remainder Theorem, Modular arithmetic.
    Exercise: Simple exercises.


Previous years: