Progressive lattice sieving
From MaRDI portal
Recommendations
Cited in
(19)- Shortest vector from lattice sieving: a few dimensions for free
- Approximate Voronoi cells for lattices, revisited
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Advanced lattice sieving on GPUs, with tensor cores
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- The general sieve kernel and new records in lattice reduction
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- The irreducible vectors of a lattice: some theory and applications
- Tuple lattice sieving
- scientific article; zbMATH DE number 475433 (Why is no real title available?)
- Sieve, Enumerate, Slice, and Lift:
- Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS
- A non-heuristic approach to time-space tradeoffs and optimizations for BKW
- Development and analysis of massive parallelization of a lattice basis reduction algorithm
- New Results on the Remote Set Problem and Its Applications in Complexity Study
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Attacking ECDSA with nonce leakage by lattice sieving: bridging the gap with Fourier analysis-based attacks
- Analyzing pump and jump BKZ algorithm using dynamical systems
- Predicting module-lattice reduction
This page was built for publication: Progressive lattice sieving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1644775)