New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=sLYMYL5uTlM


Duration: 59:17
812 views
13

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



Other Videos By Simons Institute for the Theory of Computing


2020-02-21A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms
2020-02-21Lattice Packings: An Upper Bound on the Number of Perfect Lattices
2020-02-21When Cryptography Meets Modern Channel Coding
2020-02-20PPP-completeness with connections to Cryptography
2020-02-20Provable Sieving Algorithms for SVP and CVP in the l_p norm
2020-02-20Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes
2020-02-20On Minimal Support for Lattices and Semigroups
2020-02-20Integer Programming and Convolution, with Applications
2020-02-19On the Concrete Security of LWE with Small Secret
2020-02-19Challenges in Evaluating Costs of known Lattice Attacks
2020-02-19New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
2020-02-19Algorithms for the k-List Problems
2020-02-19An LLL Algorithm for Module Lattices
2020-02-18New Bounds on the Covering Density
2020-02-18Short Simplex Paths in Lattice Polytopes
2020-02-18The n by n by n Cube and a Hyperplane
2020-02-18Successive Minima-Type Inequalities
2020-02-18A Reverse Minkowski Theorem
2020-01-31Random Circuit Sampling: Thoughts and Open Problems
2020-01-31Quantum Supremacy II
2020-01-31Quantum Supremacy I


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Lattices: Geometry Algorithms and Hardness
Leo Ducas
Benjamin Wesolowski