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.
Finite Dimensional SpacesExplores finite dimensional spaces, covering extraction process, bases generation, and space completion.
Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Algebraic GeometryCovers the fundamentals of algebraic geometry, including algebraic numbers and irreducible polynomials.
Integration on H_pxH and ArithmeCovers integration on H_pxH and arithmetic topics, focusing on the Hensel Lemma and the process of finding R and S such that R.S-P=0.
