Wessel P. J. van Woerden

Orcid: 0000-0002-5565-4015

Affiliations:
  • Institut de Mathématiques de Bordeaux, France


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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
2
2
2
4
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Lattice-based Cryptography: A survey on the security of the lattice-based NIST finalists.
IACR Cryptol. ePrint Arch., 2025

Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes.
IACR Cryptol. ePrint Arch., 2025

2024
Dense and smooth lattices in any genus.
IACR Cryptol. ePrint Arch., 2024

FuLeakage: Breaking FuLeeca by Learning Attacks.
IACR Cryptol. ePrint Arch., 2024

2022
An Algorithmic Reduction Theory for Binary Codes: LLL and More.
IEEE Trans. Inf. Theory, 2022

Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple.
IACR Cryptol. ePrint Arch., 2022

2021
A note on a Claim of Eldar & Hallgren: LLL already solves it.
IACR Cryptol. ePrint Arch., 2021

On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography.
IACR Cryptol. ePrint Arch., 2021

NTRU Fatigue: How Stretched is Overstretched?
IACR Cryptol. ePrint Arch., 2021

Advanced Lattice Sieving on GPUs, with Tensor Cores.
IACR Cryptol. ePrint Arch., 2021

2020
The randomized slicer for CVPP: sharper, faster, smaller, batchier.
IACR Cryptol. ePrint Arch., 2020

2018
The closest vector problem in tensored root lattices of type A and in their duals.
Des. Codes Cryptogr., 2018


  Loading...