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.
- Wednesday, February 26th, 2020, 14:00-16:30. Room MSA 3.210.
Course: Euclid's algorithm, Chinese Remainder Theorem, Modular arithmetic.
Exercise: Simple exercises. - Wednesday, March 4th, 2020, 14:00-16:30. Room MSA 4.040
Course: Computing with large integers
Exercise: Implementation of addition and multiplication for large integers. - Wednesday, March 11th, 2020, 14:00-16:30
Course: the RSA algorithm. Video
Exercise: implementation of RSA - Wednesday, March 18th, 2020, 14:00-16:30
Course: attacks against RSA. Video
Exercise: implementation of some attacks against RSA - Wednesday, April 8th, 2020, 14:00-16:30
Course: RSA signatures: attacks and security proofs. Video
Exercise: implementation of some attacks against RSA signatures
Previous years: