Attack on RSA using LLLCovers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
Complex Roots and PolynomialsExplores complex roots, polynomials, and factorizations, including roots of unity and the fundamental theorem of algebra.
Linear Algebra ExercisesCovers exercises related to linear algebra, focusing on finding bases and completing them in a vector space.
Interlacing PolynomialsExplores interlacing polynomials, real rooted theorems, and pseudo-probabilistic methods in polynomial analysis.
Division Euclidienne: ExemplesExplains the Euclidean division of polynomials and demonstrates its application through examples and root-based divisibility.
Analyse 2: Division euclidienneExplores the process of division euclidienne in polynomials, emphasizing the importance of polynomial degrees during operations.
