Â鶹´«Ã½AV

Lattice-based approaches are emerging as a common theme in modern cryptography and coding theory. In communications, they are indispensable 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 18 January 2017 — is aimed at connecting the two communities with a common interest in lattices, with a long-term goal of building a synergy of the two fields. It will consist of several talks on related topics, with a format that will hopefully encourage interaction.

Program:

Wouter Castryck (Université de Lille-1/KU Leuven): Remarks on the error distributions in ring-based Learning With Errors

Ana Costache (Bristol): Fixed Point Arithmetic in Somewhat Homomorphic Encryption Scheme

Victor Beresnevich (York): Talk on number theory/lattices

Anne-Maria Ernvall-Hytönen (Abo Akademi University): Secrecy Function and Comparing Lattices

Venue:

Room 611 (Dennis Gabor Seminar Room)
Department of Electrical and Electronic Engineering
Imperial College London
South Kensington
London SW7 2AZ

Registration:

Everyone is welcome. Two caveats:

Speakers are told the audience is somewhat familiar with lattices.
Please send us an email at [email protected], so that the size of the room fits with the number of participants.