Playlist: 20 videos

Lattices: Geometry, Algorithms and Hardness

1:0:18

A Reverse Minkowski Theorem

Noah Stephens-Davidowitz, MIT
https://simons.berkeley.edu/talks/reverse-minkowski-theorem-0
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:32:54

Successive Minima-Type Inequalities

Martin Henk, Technische Universität Berlin
https://simons.berkeley.edu/talks/successive-minima-type-inequalities-0
Lattices: Geometry Algorithms and Hardness
Visit talk page
0:30:32

Short Simplex Paths in Lattice Polytopes

Alberto del Pia, University of Wisconsin, Madison
https://simons.berkeley.edu/talks/short-simplex-paths-lattice-polytopes
Lattices: Geometry, Algorithms and Hardness
Visit talk page
0:29:42

The n by n by n Cube and a Hyperplane

Imre Barany, Rényi Institute
https://simons.berkeley.edu/talks/n-n-n-cube-and-hyperplane-0
Lattices: Geometry, Algorithms and Hardness
Visit talk page
0:51:35

New Bounds on the Covering Density

Barak Weiss, Tel Aviv University
https://simons.berkeley.edu/talks/n-n-n-cube-and-hyperplane
Lattices: Geometry, Algorithms and Hardness
Visit talk page
0:51:45

An LLL Algorithm for Module Lattices

Alice Pellet-Mary, KU Leuven
https://simons.berkeley.edu/talks/reverse-minkowski-theorem
Lattices: Geometry, Algorithms and Hardness
Visit talk page
1:5:57

Algorithms for the k-List Problems

Elena Kirshanova, Immanuel Kant Baltic Federal University
https://simons.berkeley.edu/talks/algorithms-k-list-problems
Lattices: Geometry, Algorithms and Hardness
Visit talk page
0:59:17

New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks

Leo Ducas, Centrum Wiskunde & Informatica & Benjamin Wesolowski, EPFL
https://simons.berkeley.edu/talks/new-reductions-and-algorithms-ideal-lattices-arakelov-random-walks
Lattices: Geometry, Algorithms and Hardness
Visit talk page
0:57:9

Challenges in Evaluating Costs of known Lattice Attacks

Tanja Lange, Technische Universiteit Eindhoven & Daniel J. Bernstein, University of Illinois at Chicago & Ruhr University Bochum
https://simons.berkeley.edu/talks/successive-minima-type-inequalities
Lattices: Geometry, Algorithms and Hardness
Visit talk page
0:30:13

On the Concrete Security of LWE with Small Secret

Lynn Chua, UC Berkeley
https://simons.berkeley.edu/talks/concrete-security-lwe-binary-secret
Lattices: Geometry, Algorithms and Hardness
Visit talk page