DIMACS Workshop on The Mathematics of Post-Quantum Cryptography

January 12 - 16, 2015
DIMACS Center, CoRE Building, Rutgers University

Organizers:

Nigel Boston, University of Wisconsin-Madison, boston at math.wisc.edu

Elisa Gorla, University of Neuchatel, elisa.gorla at unine.ch

Tanja Lange, Technische Universiteit Eindhoven, tanja at hyperelliptic.org

Joachim Rosenthal, University of Zürich, rosenthal at math.uzh.ch

Workshop Program:

Monday, January 12, 2015

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:30  Post-quantum cryptography
               Johannes Buchmann, Technische Universität Darmstadt

10:30 - 11:00  Coffee break

11:00 - 12:00  Introduction to quantum algorithms
               Daniel Bernstein, Technische Universiteit Eindhoven

12:00 -  1:00  Moving towards a quantum-safe cryptographic infrastructure
               Michele Mosca, University of Waterloo

 1:00 -  1:50  Lunch break

 1:50 -  2:00  DIMACS Director's Welcome
               Rebecca Wright
  
 2:00 -  3:00  Tweaking code-based cryptography for embedded systems 
               Tim Gueneysu, Ruhr Univ. Bochum

 3:00 -  3:30  Coffee break

 3:30 -  4:00  Vectorized implementations of post-quantum crypto 
               Peter Schwabe, Radboud U.Nijmegen

 4:00 -  4:30  Properties of symmetric primes with implications for primality testing for extremely large numbers
               Brad Clardy, Xalgos


Tuesday, January 13, 2015

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:30  NTRU and lattice-based crypto: past, present, and future
               Joseph Silverman, Brown University

10:30 - 11:00  Coffee break

11:00 - 11:30  Sieving for shortest lattice vectors using fast search algorithms
               Thijs Laarhoven, Technische Universiteit Eindhoven

11:30 - 12:00  Efficient zero-knowledge proofs of knowledge for ideal lattices
               Stephan Krenn, IBM Zurich

12:00 -  1:00  SPHINCS: practical stateless hash-based signatures
               Andreas Huelsing, Technische Universiteit Eindhoven

 1:00 -  2:00  Lunch break

 2:00 -  3:00  Multivariate Cryptosystems and Their Security: Current Estimates
               Bo-Yin Yang, Acad. Sinica

 3:00 -  3:30  coffee break

 3:30 -  4:00  MQ challenge: hardness evaluation of solving multivariate quadratic problems
               Tsuyoshi Takagi, Kyushu U.

 4:00 -  4:30  Hidden field knapsack problems
               Giacomo Micheli, University of Zürich


Wednesday, January 14, 2015

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:30  Best known attacks on code-based cryptosystems: state of the art and perspectives
               Nicolas Sendrier, INRIA

10:30 - 11:00  Coffee break

11:00 - 12:00  How to solve coding based problems used in crypto 
               Anja Becker, EPFL

12:00 -  1:00  Constructive aspects of code-based cryptography
               Marco Baldi, Università Politecnica delle Marche

 1:00 -  2:00  Lunch break

               Free afternoon


Thursday, January 15, 2015

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:30  Modern multivariate quantum-resistant cryptography 
               Daniel Smith-Tone, University of Louisville

10:30 - 11:00  Coffee break

11:00 - 11:30  The simple matrix encryption scheme  
               Albrecht Petzoldt, Technische Universität Darmstadt

11:30 - 12:00  On the existence of semi-regular sequences 
               Sergio Molina, University of Cincinnati

12:00 -  1:00  Mathematical problems arising in multivariate cryptography
               Timothy Hodges, University of Cincinnati

 1:00 -  2:00  Lunch break

 2:00 -  3:00  Attacking binary elliptic curves on a quantum computer: on 
               quantum arithmetic and space-time trade-offs 
               Martin Roetteler, Microsoft

 3:00 -  3:30  Coffee break

 3:30 -  4:00  A quantum algorithm for computing the unit group of an arbitrary degree number field  
               Sean Hallgren, Penn State

 4:00 -  4:30  Bounding HFE with SRA
               Christophe Petit, UCL Crypto Group

 5:00 -  7:00  Dinner at DIMACS (Lounge) 


Friday, January 16, 2015

 9:00 -  9:30  Breakfast and Registration

 9:30 - 10:30  SVP in 2^n time using discrete Gaussian sampling  
               Oded Regev, Courant Institute of Mathematical Sciences

10:30 - 11:00  Coffee break

11:00 - 11:30  Authenticated key exchange from ring learning with errors 
               Michael Snook, University of Cincinnati

11:30 - 12:00  RLWE-based homomorphic encryption schemes 
               Kim Laine, UC Berkeley

Previous: Participation

Next: Registration

Workshop Index

DIMACS Homepage