Lectures in course MATH-489: Number theory II.c - Cryptography

Explores Hermite's Theorem in lattices, including Minkowski's first theorem and properties of centrally symmetric lattices.

Covers the LLL algorithm for lattice reduction and discusses Hermite's constant and Minkowski's theorem.

Covers Coppersmith's method for attacking RSA encryption by efficiently finding small roots of polynomials modulo N.

Covers Coppersmith's method for finding small roots of polynomials modulo N efficiently.

Covers Fully Homomorphic Encryption (FHE) based on Gentry's 2009 scheme, explaining encryption, decryption, and multiplication processes.

Covers homomorphic encryption, focusing on Fully Homomorphic Encryption (FHE) and its applications in reducing noise in encrypted data.