Wessel P. J. van Woerden

According to our database, Wessel P. J. van Woerden authored at least 12 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists.

Koen de Boer, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2025

Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes.

Bill Allombert, Alice Pellet-Mary, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2025

2024

Dense and smooth lattices in any genus.

Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2024

FuLeakage: Breaking FuLeeca by Learning Attacks.

Felicitas Hörmann, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2024

2022

An Algorithmic Reduction Theory for Binary Codes: LLL and More.

Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden

IEEE Trans. Inf. Theory, 2022

Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple.

Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2022

2021

A note on a Claim of Eldar & Hallgren: LLL already solves it.

Léo Ducas, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2021

On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography.

Léo Ducas, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2021

NTRU Fatigue: How Stretched is Overstretched?

Léo Ducas, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2021

Advanced Lattice Sieving on GPUs, with Tensor Cores.

Léo Ducas, Marc Stevens, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2021

2020

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

Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden

IACR Cryptol. ePrint Arch., 2020

2018

The closest vector problem in tensored root lattices of type A and in their duals.

Léo Ducas, Wessel P. J. van Woerden

Des. Codes Cryptogr., 2018