Lecture #2 part 2: Lattice Reduction: Solving(?) Hard Lattice Problems. | Joseph H. Silverman
Channel: IAS | Park City Mathematics Institute | PCMI
Date: 26/07/2022

Series of lectures on the Introduction to Lattices, Lattice Reduction, and Lattice-Based Cryptography. Lecture #2: Lattice Reduction: Solving(?) Hard Lattice Problems

A lattice is a discrete subgroup of R^n. We will discuss the theory of lattices and describe how they have been used to construct practical public key cryptosystems and digital signature schemes that are, at least presently, secure against attacks by quantum computers.

Lecture #1: Lattices and Hard Lattice Problems.
Lecture #2: Lattice Reduction: Solving(?) Hard Lattice Problems.
Lecture #3: Public Key Cryptography 101: A Brief Introduction.
Lecture #4: Lattice-Based Public Key Cryptosystems.
Lecture #5: Lattice-Based Digital Signatures and Rejection Sampling.


For more information, visit https://pcmi.ias.edu