On Approximating the Covering Radius and Finding Dense Lattice Subspaces

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


Duration: 1:00:25
323 views
3

Daniel Dadush, Centrum Wiskunde & Informatica
https://simons.berkeley.edu/talks/tba-137
Lattices: Geometry Algorithms and Hardness



Other Videos By Simons Institute for the Theory of Computing


2020-02-24Overview of Attacks on Elliptic Curve Isogenies Based Systems
2020-02-24Overview of Elliptic Curve Isogenies Based Public Key Cryptography Assumptions
2020-02-24Algebraic Techniques for the Reduction of Algebraic Lattices
2020-02-24Recent Results on Attacking Hashed Periodic Functions
2020-02-22Quantum cryptanalysis with Q#
2020-02-22On Attacking Hash functions in Cryptographic schemes
2020-02-22Overview of Quantum Algorithmic Tools
2020-02-22Overview of Code-Based Crypto Assumptions
2020-02-22Overview of Quantum Cryptanalysis of Lattice Systems
2020-02-22The Relation Between SIS and LWE
2020-02-21On Approximating the Covering Radius and Finding Dense Lattice Subspaces
2020-02-21Coloring the Voronoi Tesselation of Lattices
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


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Lattices: Geometry Algorithms and Hardness
Daniel Dadush