Advanced lattice sieving on GPUs, with tensor cores
From MaRDI portal
Publication:2056731
DOI10.1007/978-3-030-77886-6_9zbMath1479.94161OpenAlexW3149570512MaRDI QIDQ2056731
Léo Ducas, Marc Stevens, Wessel P. J. van Woerden
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_9
Searching and sorting (68P10) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Data structures (68P05)
Related Items
Dual lattice attacks for closest vector problems (with preprocessing) ⋮ Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance ⋮ Towards faster polynomial-time lattice reduction ⋮ Solving the search-LWE problem over projected lattices ⋮ Generalized attack on ECDSA: known bits in arbitrary positions ⋮ \textit{Caveat implementor!} Key recovery attacks on MEGA ⋮ New time-memory trade-offs for subset sum -- improving ISD in theory and practice ⋮ EHNP strikes back: analyzing SM2 implementations ⋮ Development and analysis of massive parallelization of a lattice basis reduction algorithm ⋮ Estimating the hidden overheads in the BDGL lattice sieving algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Progressive lattice sieving
- Shortest vector from lattice sieving: a few dimensions for free
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- Slide reduction, revisited -- filling the gaps in SVP approximation
- The general sieve kernel and new records in lattice reduction
- Estimating quantum speedups for lattice sieves
- Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH
- Practical, Predictable Lattice Basis Reduction
- Tuning GaussSieve for Speed
- Tuple lattice sieving
- Gauss Sieve Algorithm on GPUs
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Sieve algorithms for the shortest vector problem are practical
- Lattice problems in NP ∩ coNP
- Lattice Enumeration Using Extreme Pruning
- Similarity estimation techniques from rounding algorithms
- Lattice-based Cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- On the equidistribution of Hecke points
- A sieve algorithm for the shortest lattice vector problem
- Improved Algorithms for the Approximate k-List Problem in Euclidean Norm
