Attack on RSA using LLLCovers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
Polynomials on a FieldCovers the construction of polynomials on a field and the concept of minimal polynomials.
Jordan Normal FormCovers the Jordan Normal Form theorem and invariance of kernels under transformations.