Tuple lattice sieving
From MaRDI portal
Publication:2971007
Recommendations
Cites work
Cited in
(18)- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Does the dual-sieve attack on learning with errors even work?
- 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
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- Progressive lattice sieving
- Improved algorithms for the approximate \(k\)-List problem in Euclidean norm
- Modular lattice signatures, revisited
- Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory
- Estimating quantum speedups for lattice sieves
- Sieve, Enumerate, Slice, and Lift:
- Lower bounds on lattice sieving and information set decoding
- The irreducible vectors of a lattice: some theory and applications
This page was built for publication: Tuple lattice sieving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971007)