Skip to main content

Workshop · No. 716

Quantum algorithms for analysis of public-key crypto

at the American Institute of Mathematics

Dates

Feb. 4, 2019 – Feb. 8, 2019

Organized by

Daniel J. Bernstein
Dan Boneh
Tanja Lange

This workshop, sponsored by AIM and the NSF, will be devoted to developing and analyzing quantum algorithms to attack public-key cryptosystems. It is known that systems based on factorization of integers and discrete logarithms will be broken by quantum computers in polynomial time. Other systems, typically based on coding theory, hash functions, isogenies, lattices, or multivariate systems of equations, are considered secure against quantum attacks, meaning that the security scales at least super-polynomially and ideally exponentially with the system parameters. However, the exact security is largely unknown and there is a lack of exchange between researchers in post-quantum cryptography and those in quantum algorithms.

The aim of this workshop is to establish a more intensive collaboration between mathematicians working on designing and analyzing public-key cryptosystems and computer scientists working on quantum algorithms. Bringing together this expertise is essential to ensure that current proposals in post-quantum cryptography, an area working on alternatives to cryptography based on factorization and discrete logarithms with the aim to find algorithms that withstand attacks by quantum computers, actually get analyzed with the full power of both fields.

The main topics for the workshop are

  • Exact security of ECC and RSA under quantum attacks
  • Quantum algorithms for generic post-quantum systems
  • Quantum algorithms for post-quantum systems with extra structure

This event will be run as an AIM-style workshop. Participants will be invited to suggest open problems and questions before the workshop begins, and these will be posted on the workshop website. These include specific problems on which there is hope of making some progress during the workshop, as well as more ambitious problems which may influence the future activity of the field. Lectures at the workshop will be focused on familiarizing the participants with the background material leading up to specific problems, and the schedule will include discussion and parallel working sessions.

Participants

28
Gorjan Alagic University of Maryland galagic@gmail.com
Matthew Amy University of Waterloo meamy@uwaterloo.ca
Shi Bai Florida Atlantic University sbai@fau.edu
Gustavo Banegas TU/e gustavo@cryptme.in
Daniel Bernstein University of Illinois at Chicago djb@math.uic.edu
Jean-Francois Biasse University of South Florida biasse@lix.polytechnique.fr
Dan Boneh Stanford University dabo@cs.stanford.edu
Xavier Bonnetain Inria xavier.bonnetain@inria.fr
Kirsten Eisentraeger Penn State University eisentra@math.psu.edu
Sean Hallgren hallgren@cse.psu.edu
Mike Hamburg Rambus mike@shiftleft.org
Elena Kirshanova ENS Lyon elena.kirshanova@ens-lyon.fr
Greg Kuperberg UC Davis greg@math.ucdavis.edu
Thijs Laarhoven Eindhoven University of Technology mail@thijs.com
Tanja Lange Technische Universiteit Eindhoven tanja@hyperelliptic.org
Travis Morrison University of Waterloo, Institute for Quantum Computing tmo@vt.edu
Michele Mosca Institute for Quantum Computing at University of Waterloo michele.mosca@uwaterloo.ca
Lorenz Panny l.s.panny@tue.nl
Edoardo Persichetti Florida Atlantic University epersichetti@fau.edu
Benjamin Pring University of Bath (2018) University of South Florida (2019) b.i.pring@bath.ac.uk
John Schanck University of Waterloo jschanck@uwaterloo.ca
Andre Schrottenloher Inria andre.schrottenloher@inria.fr
Daniel Simon Amazon Web Services drsimon@amazon.com
Fang Song Texas A&M Univeristy fang.song@tamu.edu
Caleb Springer The Pennsylvania State University c.springer@ucl.ac.uk
Iggy van Hoof i.v.hoof@student.tue.nl