Analyse 2: Division euclidienneExplores the process of division euclidienne in polynomials, emphasizing the importance of polynomial degrees during operations.
Attack on RSA using LLLCovers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.