Computational Challenges in the Theory of Lattices
(April 23 – 27, 2018)



This workshop will focus on the computational aspects of the theory of Euclidean lattices and on their applications to other areas in mathematics and computer science. It will put emphasis on computational challenges on lattice problems that have recently arisen from unexpected connections to other domains such as algebraic topology, automorphic forms, or cryptography.

A major goal of this workshop is to bring together researchers from different areas, working with Euclidean lattices, and to facilitate their interactions.

Topics will include the reduction theory of lattices and its applications, Voronoi algorithms and their use to compute the cohomology of arithmetic groups, the classification of lattice genera and the computation of spaces of modular forms, the algorithmic aspects of lattice based cryptography, in particular the relationship between the security of cryptographic primitives and the hardness of lattice problems.

Organizing Committee