discrete subgroup

~~Non-Lattice (!) Coding & Crypto Meeting~~

This meeting has been postponed. We will announce a new date.

This meeting – on Friday 20 March 2020 – is aimed at non-lattice approaches to post-quantum cryptography. It will consist of several talks on related topics, with a format aimed at encouraging interaction.

Programme

11:00 - 12:00 | Cen Jung Tjhai: Decoding of Goppa codes

13:00 - 14:30 | Maximilien Gadouleau: Introduction to rank metric codes

Rank metric codes are codes on matrices, where the distance is the so-called rank metric (the rank of the difference between two matrices). These codes have notably been proposed in several post-quantum, code-based, cryptosystems. In this talk, we will review some of the main properties and results on those codes, including: how they can be viewed as codes on matrices or on vectors, the class of optimal Gabidulin codes and maximum rank-distance (MRD) codes in general, their proposed applications to data storage and network coding, and the use of skew-polynomial rings. We will also indicate which areas of that theory are still under development.

14:45 - 16:15| Jean-Pierre Tillich: Cryptography based on rank metric codes

16:30 - 18:00 | Christophe Petit: Post-Quantum Cryptography Based on Supersingular Isogeny Problems?

The security of many cryptographic protocols in use today relies on the computational hardness of mathematical problems such as integer factorization. These problems can be solved using quantum computers, and therefore most of our security infrastructures will become completely insecure once quantum computers are built. Post-quantum cryptography aims at developing security protocols that will remain secure even after quantum computers are built. The biggest security agencies in the world including GCHQ and the NSA have recommended a move towards post-quantum protocols, and the new generation of cryptographic standards will aim at post-quantum security. In this talk I will discuss isogeny-based cryptography, a particular family of protocols that are considered for post-quantum security. Isogeny-based protocols have appealing properties including the shortest key sizes among post-quantum cryptography candidates, practical constructions for key exchange and signature, and a clear mathematical elegance.

18:00 - | Workshop Dinner

Venue

Room 611 Department of Electrical and Electronic Engineering
Imperial College London
South Kensington
London SW7 2AZ

Registration

Everyone is welcome. Two caveats:

  1. Speakers are told the audience is somewhat familiar with lattices.
  2. Please send us an email at c.ling@imperial.ac.uk to register.