Advanced lattice sieving on GPUs, with tensor cores
From MaRDI portal
Publication:2056731
Recommendations
Cites work
- A sieve algorithm for the shortest lattice vector problem
- Efficient (ideal) lattice sieving using cross-polytope LSH
- Estimating quantum speedups for lattice sieves
- Faster exponential time algorithms for the shortest vector problem
- Finding short lattice vectors within Mordell's inequality
- Gauss sieve algorithm on GPUs
- Improved algorithms for the approximate k-List problem in Euclidean norm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Lattice problems in NP ∩ coNP
- Lattice-based Cryptography
- New directions in nearest neighbor searching with applications to lattice sieving
- On the equidistribution of Hecke points
- Practical, Predictable Lattice Basis Reduction
- Progressive lattice sieving
- Shortest vector from lattice sieving: a few dimensions for free
- Sieve algorithms for the shortest vector problem are practical
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Similarity estimation techniques from rounding algorithms
- Slide reduction, revisited -- filling the gaps in SVP approximation
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- The general sieve kernel and new records in lattice reduction
- Tuning GaussSieve for speed
- Tuple lattice sieving
Cited in
(26)- 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
- The general sieve kernel and new records in lattice reduction
- Gauss sieve algorithm on GPUs
- 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
- New NTRU Records with Improved Lattice Bases
- Concrete analysis of quantum lattice enumeration
- Memory-efficient attacks on small LWE keys
- Memory-efficient attacks on small LWE keys
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- A complete analysis of the BKZ lattice reduction algorithm
- Accurate score prediction for Dual-Sieve attacks
- Attacking ECDSA with nonce leakage by lattice sieving: bridging the gap with Fourier analysis-based attacks
- Heuristic algorithm for solving restricted SVP and its applications
- Analyzing pump and jump BKZ algorithm using dynamical systems
- Towards a modern LLL implementation
- Predicting module-lattice reduction
- Towards large-scale lattice attack: new lattice records by disk-based sieving
- Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions
- Dual lattice attacks for closest vector problems (with preprocessing)
This page was built for publication: Advanced lattice sieving on GPUs, with tensor cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056731)
