Workshops

Spring 2020

Lattices: Geometry, Algorithms and Hardness

Feb 18, 2020 to Feb 21, 2020

Return to event »

Tuesday, February 18th, 2020
9:15 am–9:45 am		Coffee and Check-In
9:45 am–10:00 am		Welcome Remarks
10:00 am–11:00 am		A Reverse Minkowski Theorem Noah Stephens-Davidowitz, MIT
11:00 am–11:30 am		Break
11:30 am–12:00 pm		Successive Minima-Type Inequalities Martin Henk, Technische Universität Berlin
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Short Simplex Paths in Lattice Polytopes Alberto del Pia, University of Wisconsin, Madison
2:30 pm–3:00 pm		The n by n by n Cube and a Hyperplane Imre Barany, Rényi Institute
3:00 pm–3:30 pm		Break
3:30 pm–4:15 pm		New Bounds on the Covering Density Barak Weiss, Tel Aviv University
4:15 pm–5:30 pm		Reception

Wednesday, February 19th, 2020
9:15 am–9:45 am		Coffee and Check-In
9:45 am–10:30 am		An LLL Algorithm for Module Lattices Alice Pellet-Mary, KU Leuven
10:30 am–11:00 am		Break
11:00 am–11:45 am		Algorithms for the k-List Problems Elena Kirshanova, Immanuel Kant Baltic Federal University
11:45 am–1:45 pm		Lunch
1:45 pm–2:45 pm		New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks Leo Ducas, Centrum Wiskunde & Informatica & Benjamin Wesolowski , EPFL
2:45 pm–3:30 pm		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 pm–4:00 pm		Break
4:00 pm–4:30 pm		On the Concrete Security of LWE with Small Secret Lynn Chua, UC Berkeley
4:30 pm–5:30 pm		Open Problems

Thursday, February 20th, 2020
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Integer Programming and Convolution, with Applications Klaus Jansen , University of Kiel
10:30 am–11:00 am		Break
11:00 am–11:30 am		On Minimal Support for Lattices and Semigroups Timm Oertel, Cardiff University
11:30 am–12:00 pm		Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes Iskander Aliev, Cardiff University
12:00 pm–2:00 pm		Lunch
2:00 pm–2:45 pm		PPP-completeness with connections to Cryptography Aikaterini Sotiraki, MIT
2:45 pm–3:15 pm		Provable Sieving Algorithms for SVP and CVP in the l_p norm Priyanka Mukhopadhyay, Unviersity of Waterloo
3:15 pm–3:45 pm		Break
3:45 pm–4:15 pm		A Polynomial Time Algorithm for Solving the Closest Vector Problem for Lattices Related to Zonotopes Frank Vallentin, Unversity of Cologne

Friday, February 21st, 2020
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		When Cryptography Meets Modern Channel Coding Joseph J. Boutros, Texas A&M University
10:30 am–11:00 am		Break
11:00 am–11:30 am		Lattice Packings: An Upper Bound on the Number of Perfect Lattices Wessel van Woerden, CWI
11:30 am–12:00 pm		A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms Achill Schurmann, University of Rostock
12:00 pm–2:00 pm		Lunch
2:00 pm–2:45 pm		Coloring the Voronoi Tesselation of Lattices Mathieu Dutour Sikiric, Institut Rudjer Boskovic
2:45 pm–3:30 pm		On Approximating the Covering Radius and Finding Dense Lattice Subspaces Daniel Dadush, Centrum Wiskunde & Informatica