Lattices: Geometry, Algorithms and Hardness

Program

Lattices: Algorithms, Complexity, and Cryptography

Location

Calvin Lab Auditorium

Date

Tuesday, Feb. 18 – Friday, Feb. 21, 2020

Back to calendar

9:15 – 9:45 a.m.

Coffee and Check-In

9:45 – 10 a.m.

Welcome Remarks

10 – 11 a.m.

A Reverse Minkowski Theorem

Noah Stephens-Davidowitz, MIT

11 – 11:30 a.m.

Break

11:30 a.m. – 12 p.m.

Successive Minima-Type Inequalities

Martin Henk, Technische Universität Berlin

12 – 2 p.m.

Lunch

2 – 2:30 p.m.

Short Simplex Paths in Lattice Polytopes

Alberto del Pia, University of Wisconsin, Madison

2:30 – 3 p.m.

The n by n by n Cube and a Hyperplane

Imre Barany, Rényi Institute

3 – 3:30 p.m.

Break

3:30 – 4:15 p.m.

New Bounds on the Covering Density

Barak Weiss, Tel Aviv University

4:15 – 5:30 p.m.

Reception

9:15 – 9:45 a.m.

Coffee and Check-In

9:45 – 10:30 a.m.

An LLL Algorithm for Module Lattices

Alice Pellet-Mary, KU Leuven

10:30 – 11 a.m.

Break

11 – 11:45 a.m.

Algorithms for the k-List Problems

Elena Kirshanova, Immanuel Kant Baltic Federal University

11:45 a.m. – 1:45 p.m.

Lunch

1:45 – 2:45 p.m.

New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks

Leo Ducas, , Centrum Wiskunde & Informatica, & Benjamin Wesolowski, , EPFL

2:45 – 3:30 p.m.

Challenges in Evaluating Costs of known Lattice Attacks

Tanja Lange, Technische Universiteit Eindhoven, Daniel J. Bernstein, University of Illinois at Chicago & Ruhr University Bochum

3:30 – 4 p.m.

Break

4 – 4:30 p.m.

On the Concrete Security of LWE with Small Secret

Lynn Chua, UC Berkeley

4:30 – 5:30 p.m.

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

Integer Programming and Convolution, with Applications

Klaus Jansen, , University of Kiel

10:30 – 11 a.m.

Break

11 – 11:30 a.m.

On Minimal Support for Lattices and Semigroups

Timm Oertel, Cardiff University

11:30 a.m. – 12 p.m.

Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes

Iskander Aliev, Cardiff University

12 – 2 p.m.

Lunch

2 – 2:45 p.m.

PPP-completeness with connections to Cryptography

Aikaterini Sotiraki, MIT

2:45 – 3:15 p.m.

Provable Sieving Algorithms for SVP and CVP in the l_p norm

Priyanka Mukhopadhyay, Unviersity of Waterloo

3:15 – 3:45 p.m.

Break

3:45 – 4:15 p.m.

A Polynomial Time Algorithm for Solving the Closest Vector Problem for Lattices Related to Zonotopes

Frank Vallentin, Unversity of Cologne

9 – 9:30 a.m.

Coffee and Check-In

9:30 – 10:30 a.m.

When Cryptography Meets Modern Channel Coding

Joseph J. Boutros, Texas A&M University

10:30 – 11 a.m.

Break

11 – 11:30 a.m.

Lattice Packings: An Upper Bound on the Number of Perfect Lattices

Wessel van Woerden, CWI

11:30 a.m. – 12 p.m.

A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms

Achill Schurmann, University of Rostock

12 – 2 p.m.

Lunch

2 – 2:45 p.m.

Coloring the Voronoi Tesselation of Lattices

Mathieu Dutour Sikiric, Institut Rudjer Boskovic

2:45 – 3:30 p.m.

On Approximating the Covering Radius and Finding Dense Lattice Subspaces

Daniel Dadush, Centrum Wiskunde & Informatica