Artur Mariano,

Universität Darmstadt –

Abstract:

Quantum computers pose a serious threat to cryptoschemes, since classic schemes like RSA or Diffie-Hellman can be broken in the presence of quantum computers. Lattice-based cryptography stands out as one of the most prominent types of quantum immune cryptography. The main task taken on by cryptographers at this point in time is the assessment of potential attacks against lattice-based schemes, and the developement of schemes which manage to thwart the attacks that are known up until now. In this talk, I will present lattice-based cryptography from a cryptanalysis (aka attack) standpoint. To this end, I will explain what lattices are, which lattice problems are interesting for cryptography and which algorithms are usually used to address these problems. I will then select specific algorithms for the SVP, a particularly relevant problem, and explain in detail how they work and how they can be implemented and parallelized efficiently on shared-memory CPU systems. This is achieved with lock-free data-structures that scale linearly with the number of used cores, and HPC techniques such as data prefeching and memory pools.

Bio

He is a staff member of the Scientific Computing Group of Technische Universität Darmstadt in Darmstadt, Germany. During 2012, he had a full-time research position at LabCG, a research group in High Performance and Graphics, at the Computer Science Department of the University of Minho, Braga, Portugal. He was also a fortunate FCT – Fundacao para a Ciencia e Tecnologia – grant holder during two years. Prior to joining LabCG, he worked on another research project, that focused on High Performance Image processing. In the meantime he also had the opportunity of doing a research internship at the University of Texas at Austin, Texas, USA.

 

Date: 2015-Jul-23     Time: 17:30:00     Room: 020

For more information: