HTTP/2 200 date: Sat, 27 Dec 2025 19:42:15 GMT content-type: text/html last-modified: Sun, 12 Oct 2025 18:10:14 GMT nel: {"report_to":"cf-nel","success_fraction":0.0,"max_age":604800} vary: Accept-Encoding report-to: {"group":"cf-nel","max_age":604800,"endpoints":[{"url":"https://a.nel.cloudflare.com/report/v4?s=qM%2FyQZUzy1w0fDpi41MRVqPjq6KYFGXSTp%2F%2Fe8cuHWYAYbSnG%2Bw0Hp87H8iIIF4bllvWJY3agBOaxHx82dqTfT60NnS9qnbpy5iH1EgXsHDXuMvQ"}]} server: cloudflare cf-cache-status: DYNAMIC content-encoding: gzip cf-ray: 9b4b4ccf69e9de58-BOM alt-svc: h3=":443"; ma=86400

Wessel van Woerden

Researcher in Cryptology

PQShield

About Me

Hi, currently I am working as a cryptography researcher at PQShield. Before this I was a post-doctoral researcher in the Number Theory group at the Institut de Mathématiques de Bordeaux. From 2018 to 2022 I was a PhD student of Léo Ducas at CWI in Amsterdam, and I obtained my doctorate at Leiden University in February 2023.

I like working on the border between Mathematics and Computer Science, with a main love for algorithms. Lattices are a returning object in my research: tensored root lattices (BsC Thesis), enumeration of perfect lattices (MsC Thesis), and lattice based cryptanalysis (PhD).

Interests

• Cryptanalysis
• Lattices
• Algorithms

Education

• Researcher in Cryptology, Currently

  PQShield

• Post-doc in Cryptology, 2025

  Institut de Mathématiques de Bordeaux

• PhD in Cryptology, 2023

  Centrum Wiskunde & Informatica (CWI) & Leiden University

• MSc in Mathematics, 2018

  Leiden University

• BSc in Mathematics & Computer Science, 2016

  Leiden University

Publications

The lattice packing problem in dimension 9 by Voronoi's algorithm.
PDF Cite
Mathieu Dutour Sikirić, Wessel van Woerden
arXiv preprint arXiv:2508.20719, 2025.

Large smooth twins from short lattice vectors.
PDF Cite
Erik Mulder, Bruno Sterner, Wessel van Woerden
Cryptology ePrint Archive, 2025.

A search to distinguish reduction for the isomorphism problem on direct sum lattices.
PDF Cite
Daniël van Gent, Wessel van Woerden
Asiacrypt, 2025.

Beyond LWE: a Lattice Framework for Homomorphic Encryption.
PDF Cite
Alberto Leporati, Lorenzo Rovida, Wessel van Woerden
Cryptology ePrint Archive, 2025.

Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes.
PDF Cite
Bill Allombert, Alice Pellet-Mary, Wessel van Woerden
Eurocrypt, 2025.

Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists.
PDF Cite
Koen de Boer, Wessel van Woerden
Report, 2025.

Complete classification of six-dimensional iso-edge domains.
PDF Cite
Mathieu Dutour Sikirić, Wessel van Woerden
Foundations of Crystallography, 2025.

Dense and smooth lattices in any genus.
PDF Cite
Wessel van Woerden
Asiacrypt, 2024.

FuLeakage: Breaking FuLeeca by Learning Attacks.
PDF Cite
Felicitas Hörmann, Wessel van Woerden
Crypto, 2024.

Lattice Cryptography: from Cryptanalysis to New Foundations.
PDF Cite
Wessel van Woerden
PhD Thesis, Leiden University, 2023.

Hawk: Module LIP makes lattice signatures fast, compact and simple.
PDF Cite
Léo Ducas, Eamonn W Postlethwaite, Ludo N Pulles, Wessel van Woerden
Asiacrypt, 2023.

On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography.
PDF Cite
Léo Ducas, Wessel van Woerden
Eurocrypt, 2022.

An Algorithmic Reduction Theory for Binary Codes: LLL and more.
PDF Cite
Thomas Debris–Alazard, Léo Ducas, Wessel van Woerden
IEEE Transactions on Information Theory, 2022.

NTRU Fatigue: How Stretched is Overstretched?.
PDF Cite
Léo Ducas, Wessel van Woerden
Asiacrypt, 2021.

Advanced Lattice Sieving on GPUs, with Tensor Cores.
PDF Cite
Léo Ducas, Marc Stevens, Wessel van Woerden
Eurocrypt, 2021.

A Canonical Form for Positive Definite Matrices.
PDF Cite
Mathieu Dutour Sikirić, Anna Haensch, John Voight, Wessel PJ van Woerden
ANTS, 2020.

An upper bound on the number of perfect quadratic forms.
PDF Cite
Wessel PJ van Woerden
Advances in Mathematics, 2020.

The randomized slicer for CVPP: sharper, faster, smaller, batchier.
PDF Cite
Léo Ducas, Thijs Laarhoven, Wessel PJ van Woerden
PKC, 2020.

Perfect Quadratic forms: an Upper Bound and Challenges in Enumeration.
PDF Cite
Wessel PJ van Woerden
Master Thesis, Leiden University, 2018.

The closest vector problem in tensored root lattices of type A and in their duals.
PDF Cite
Léo Ducas, Wessel PJ van Woerden
Designs, Codes and Cryptography, 2018.

Talks

Recent & Upcoming

The lattice packing problem in dimension 9 by Voronoi's algorithm
Slides

Sep 30, 2025 IMB, Bordeaux, France

Dense (and smooth) lattices in any genus
Slides

Sep 23, 2025 Inria Saclay, Palaiseau, France

A Short Survey of Cryptography Based on the Lattice Isomorphism Problem
Slides

Sep 16, 2025 KNAW, Amsterdam, Netherlands

The lattice packing problem in dimension 9 by Voronoi's algorithm
Slides

Sep 12, 2025 Cottbus, Germany

Dense and smooth lattices in any genus
Slides

Jul 4, 2025 Imperial College, London, United Kingdom

See all talks