default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWessel P. J. van Woerden
Person information
- affiliation: Institut de Mathématiques de Bordeaux, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Wessel P. J. van Woerden
:
Dense and Smooth Lattices in Any Genus. ASIACRYPT (4) 2024: 386-417- [c6]Felicitas Hörmann, Wessel P. J. van Woerden:
FuLeakage: Breaking FuLeeca by Learning Attacks. CRYPTO (6) 2024: 253-286 - [i10]Felicitas Hörmann, Wessel P. J. van Woerden:
FuLeakage: Breaking FuLeeca by Learning Attacks. IACR Cryptol. ePrint Arch. 2024: 353 (2024) - [i9]Wessel P. J. van Woerden:
Dense and smooth lattices in any genus. IACR Cryptol. ePrint Arch. 2024: 1468 (2024) - 2022
- [j2]Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden:
An Algorithmic Reduction Theory for Binary Codes: LLL and More. IEEE Trans. Inf. Theory 68(5): 3426-3444 (2022) - [c5]Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel P. J. van Woerden:
Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple. ASIACRYPT (4) 2022: 65-94 - [c4]Léo Ducas, Wessel P. J. van Woerden:
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography. EUROCRYPT (3) 2022: 643-673 - [i8]Léo Ducas, Eamonn W. Postlethwaite, Ludo N. Pulles, Wessel P. J. van Woerden:
Hawk: Module LIP makes Lattice Signatures Fast, Compact and Simple. IACR Cryptol. ePrint Arch. 2022: 1155 (2022) - 2021
- [c3]Léo Ducas, Wessel P. J. van Woerden:
NTRU Fatigue: How Stretched is Overstretched? ASIACRYPT (4) 2021: 3-32 - [c2]Léo Ducas, Marc Stevens, Wessel P. J. van Woerden:
Advanced Lattice Sieving on GPUs, with Tensor Cores. EUROCRYPT (2) 2021: 249-279 - [i7]Léo Ducas, Marc Stevens, Wessel P. J. van Woerden:
Advanced Lattice Sieving on GPUs, with Tensor Cores. IACR Cryptol. ePrint Arch. 2021: 141 (2021) - [i6]Léo Ducas, Wessel P. J. van Woerden:
NTRU Fatigue: How Stretched is Overstretched? IACR Cryptol. ePrint Arch. 2021: 999 (2021) - [i5]Léo Ducas, Wessel P. J. van Woerden:
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography. IACR Cryptol. ePrint Arch. 2021: 1332 (2021) - [i4]Léo Ducas, Wessel P. J. van Woerden:
A note on a Claim of Eldar & Hallgren: LLL already solves it. IACR Cryptol. ePrint Arch. 2021: 1391 (2021) - 2020
- [c1]Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden:
The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier. Public Key Cryptography (2) 2020: 3-36 - [i3]Léo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden:
The randomized slicer for CVPP: sharper, faster, smaller, batchier. IACR Cryptol. ePrint Arch. 2020: 120 (2020) - [i2]Thomas Debris-Alazard, Léo Ducas, Wessel P. J. van Woerden:
An Algorithmic Reduction Theory for Binary Codes: LLL and more. IACR Cryptol. ePrint Arch. 2020: 869 (2020)
2010 – 2019
- 2018
- [j1]Léo Ducas, Wessel P. J. van Woerden:
The closest vector problem in tensored root lattices of type A and in their duals. Des. Codes Cryptogr. 86(1): 137-150 (2018) - 2016
- [i1]Léo Ducas, Wessel P. J. van Woerden:
The closest vector problem in tensored root lattices of type A and in their duals. IACR Cryptol. ePrint Arch. 2016: 910 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
