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

Slides:

• Marco Baldi, Università Politecnica delle Marche
  Constructive Aspects of Code-based Cryptography

• Johannes Buchmann, Technische Universität Darmstadt
  Post-Quantum Cryptography

• Brad Clardy, Xalgos
  Properties of Symmetric Primes with Implications for Primality Testing for Extremely Large Numbers

• Tim Gueneysu, Ruhr Univ. Bochum
  Tweaking Code-based Cryptography for Embedded Systems

• Timothy Hodges, University of Cincinnati
  Mathematical Problems in Multivariate Public Key Cryptography

• Kim Laine, UC Berkeley
  Key Recovery for LWE in Polynomial Time

• Thijs Laarhoven, Technische Universiteit Eindhoven
  Sieving for Shortest Lattice Vectors using Fast Search Algorithms

• Sergio Molina, University of Cincinnati
  On the Existence of Semi-regular Sequences

• Albrecht Petzoldt, Technische Universität Darmstadt
  The Simple Matrix Encryption Scheme

• Martin Roetteler, Microsoft
  Attacking Binary Elliptic Curves on a Quantum Computer: on Quantum Arithmetic and Space-time Trade-offs

• Joseph Silverman, Brown University
  NTRU and Lattice-Based Crypto: Past, Present, and Future

• Michael Snook, University of Cincinnati
  Authenticated key exchange from ring learning with errors

Workshop Index

DIMACS Homepage