Finite Dimensional SpacesExplores finite dimensional spaces, covering extraction process, bases generation, and space completion.
Attack on RSA using LLLCovers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.
Proof Techniques: ExamplesCovers proof techniques including direct proof, contraposition, contradiction, cases, and counterexample.
Polynomial Identity TestingCovers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.