Lattice-based approaches are emerging as a common theme in modern cryptography and coding theory. In communications, they are useful mathematical tools to construct powerful error-correction codes achieving the capacity of wireless channels. In cryptography, they are used to building lattice-based schemes with provable security, better asymptotic efficiency, resilience against quantum attacks and new functionalities such as fully homomorphic encryption. This meeting — on 24 September 2018 — is aimed at connecting the two communities with a common interest in lattices. It will consist of several talks on related topics, with a format aimed at encouraging interaction.

Programme

10:30 – 12:00 | Leo Ducas: The General Sieve Kernel and New Records in Lattice Reduction

13:00 – 14:30 | Krzysztof Latuszynski: Markov chain Monte Carlo: design and optimisation

15:00 – 16:30 | James Howe: Standard Lattice-Based Key Encapsulation on Embedded Devices

16:45 – 18:15 | Laura Luzzi: Algebraic reduction for low-complexity lattice decoding