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.

  1. Tuesday, March 4th, 2025, 8:00-10:30. Room MSA 3.350.
    Course: basic number theory for cryptography. Video
  2. Tuesday, March 11th, 2025, 8:30-11:00. Room MSA 3.350.
    Course: computing with large integers. Video
    Exercise: implementation of addition and multiplication for large integers.
  3. Tuesday, March 18th, 2025, 8:30-11:00. Room MSA 3.350.
    Course: the RSA algorithm. Video
    Exercise: Implementation of RSA
  4. Tuesday, March 25th, 2025, 8:30-11:00. Room MSA 3.350.
    Course: attacks against RSA. Video
    Exercise: implementation of some attacks against RSA
  5. Tuesday, April 1st, 2025, 8:30-11:00. Room MSA 3.350.
    Course: RSA signatures: attacks and security proofs. Video
    Exercise: implementation of some attacks against RSA signatures
  6. Tuesday, April 8th, 2025, 8:30 - 11:00. Room MSA 3.350.
    Course: Side channel attacks and countermeasures.
  7. Tuesday, April 22th, 2025, 8:30 - 11:00. Room MSA 3.350.
    Course: Discrete-log based cryptography
    Exercise: implementation of ElGamal encryption.
  8. Tuesday, April 29th, 2025, 8:30 - 11:00. Room MSA 3.350.
    Course: Elliptic-curve cryptography
    Exercise: implementation of EC ElGamal encryption.
  9. Tuesday, May 13th, 2025, 8:30 - 11:00. Room MSA 3.350.
    Course: Fully homomorphic encryption. Part 1: basic techniques.
    Exercise: implementation of DGHV.
  10. Tuesday, May 20th, 2025, 8:30 - 11:00. Room MSA 3.350
    Course: Fully homomorphic encryption. Part 2: leveled FHE and bootstrapping.
    Exercise: implementation of LWE-based homomorphic encryption.

Previous years: