Attack on RSA using LLLCovers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
Interlacing PolynomialsExplores interlacing polynomials, real rooted theorems, and pseudo-probabilistic methods in polynomial analysis.
Complex Roots and PolynomialsExplores complex roots, polynomials, and factorizations, including roots of unity and the fundamental theorem of algebra.
