Workshop on cryptography in the quantum age

Map Unavailable
06/11/2018 - 09/11/2018
10:00 - 17:00
STIAS Wallenberg Research Centre

Even though we have some basic understanding of the power of quantum computation, and its impact on cryptography and cryptanalysis, there are many open problems, some of them purely technical and some more fundamental. The workshop will focus on the following three main themes:

  • Quantum Algorithms. In order to make a reasonable assessment of the risk posed by quantum technology we will look into quantum algorithms that can impact cryptanalysis. These will involve variants of Shor’s factoring and discrete log algorithms, different versions of Grover’s search algorithm and attempts to design a quantum algorithm that may challenge the integrity of the lattice based cryptography.
  • Quantum Cryptography. We shall investigate the physical limits of privacy offered by quantum theory, including device independent key distribution, randomness amplification and expansion, and some aspects of blind quantum computation that may be relevant to designing a quantum homomorphic encryption.
  • Quantum Resistant Cryptography. It is still an open question which particular mathematical problems will be most suitable for designing public key cryptosystems that will be resistant to quantum attacks. The candidates range from problems involving vectors in lattices to arithmetic modulo Mersenne numbers.

The workshop brings together participants from Computer Science, Physics, and Mathematics to exchange ideas and reflect on these questions. It is organized as part of Spring 2018 STIAS project on Cryptography in the quantum age led by Artur Ekert. The workshop is co-organized by:

  • Artur Ekert (University of Oxford and National University of Singapore)
  • Miklos Santha (Université Paris Diderot – Paris 7)
  • Antoine Joux (Sorbonne Université)
  • Troy Lee (University of Technology Sydney)
  • Marco Tomamichel (University of Technology Sydney)

More information about participation and the programme can be found here.




Leave a Reply