Tuning GaussSieve for speed
From MaRDI portal
Recommendations
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- Gauss sieve algorithm on GPUs
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices
- Sieving for shortest vectors in ideal lattices
- Sieving for shortest vectors in ideal lattices: a practical perspective
Cited in
(15)- Sieving for shortest vectors in ideal lattices: a practical perspective
- Progressive lattice sieving
- Shortest vector from lattice sieving: a few dimensions for free
- Sieving for closest lattice vectors (with preprocessing)
- Advanced lattice sieving on GPUs, with tensor cores
- Estimating quantum speedups for lattice sieves
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Gauss sieve algorithm on GPUs
- Analysis of Gauss-sieve for solving the shortest vector problem in lattices
- Sieving for shortest vectors in ideal lattices
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
- Lattice Sieving via Quantum Random Walks
- Estimating the hidden overheads in the BDGL lattice sieving algorithm
- Attacking ECDSA with nonce leakage by lattice sieving: bridging the gap with Fourier analysis-based attacks
This page was built for publication: Tuning GaussSieve for speed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946481)