Recent & Upcoming Talks

2024

Dense and smooth lattices in any genus

Dec 13, 2024 Kolkata, India
Slides

Dense (and smooth) lattices in any genus

Dec 5, 2024 MPI Bonn, Germany
Slides

The Lattice Isomorphism Problem algorithms and invariants

Aug 7, 2024 Budapest, Hungary
Slides

On the existence of good lattice packings and smoothing within a fixed genus

Mar 27, 2024 CWI, Amsterdam, Netherlands
Slides

Lecture: Lattice cryptography and cryptanalysis

Mar 14, 2024 PQC Spring School 2024, QSI, Porto, Portugal
Slides Video

[Co-organized] Attacc: Workshop on Lattice- and Code-Based Cryptanalysis

Feb 5, 2024 German Aerospace Center (DLR), Oberpfaffenhofen, Germany
PDF

2023

On LIP, Cryptography and the Signature Scheme HAWK

Feb 22, 2023 RISC Seminar on Lattice-based Cryptography, CWI, Amsterdam
Slides

An Algorithmic Reduction Theory for Binary Codes: LLL and More

Jan 31, 2023 LFANT Seminar, Institut de Mathématiques de Bordeaux
Slides

On LIP, Cryptography and the Signature Scheme HAWK

Jan 27, 2023 Séminaire de Cryptographie, Inria, Rennes
Slides

2022

On LIP, Quadratic Forms, Remarkable Lattices, and Cryptography

Jun 15, 2022 COSIC Seminar, COSIC, Leuven
Slides Video

On LIP, Quadratic Forms, Remarkable Lattices, and Cryptography

Jun 2, 2022 Eurocrypt 2022, Trondheim
Slides Video

On LIP, Quadratic Forms, Remarkable Lattices, and Cryptography

May 18, 2022 LFANT Seminar, Institut de Mathématiques de Bordeaux
Slides

An Algorithmic Reduction Theory for Binary Codes: LLL and More

Mar 25, 2022 Post-Quantum Cryptanalysis Workshop, Birmingham
Slides

On LIP, Quadratic Forms, Remarkable Lattices, and Cryptography

Mar 22, 2022 Post-Quantum Cryptanalysis Workshop, Birmingham
Slides

2020

A Canonical Form for Positive Definite Matrices

Jul 2, 2020 Fourteenth Algorithmic Number Theory Symposium (ANTS 2020)
Slides Video

The randomized slicer for CVPP: sharper, faster, smaller, batchier

Jun 1, 2020 IACR International Conference on Public-Key Cryptography
Slides Video

Lattice packings: an upper bound on the number of perfect lattices

We consider an algorithmic approach by Voronoi to solve the lattice packing problem in any fixed dimension. After a visual introduction …
Feb 21, 2020 Simons Institute, Berkeley
Slides Video

2019

A tight analysis of the Iterative Slicer to solve the Closest Vector Problem

We consider the Iterative Slicer algorithm to solve the Closest Vector Problem with Preprocessing. The success probability of this …
Oct 3, 2019 ENS Lyon

2018

Challenges in Enumerating Perfect Quadratic Forms

We consider the lattice packing problem and a classical method to solve it by enumerating perfect quadratic forms. We show an improved …
Jun 6, 2018 Universität Rostock