Fast lattice point enumeration with minimal overhead
From MaRDI portal
(Redirected from Publication:5363033)
Recommendations
- Lattice enumeration using extreme pruning
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Lattice Point Enumeration on Block Reduced Bases
- Lower bounds on lattice enumeration with extreme pruning
Cited in
(31)- Shortest vector from lattice sieving: a few dimensions for free
- Sieving for closest lattice vectors (with preprocessing)
- Lower bounds on lattice enumeration with extreme pruning
- Approximate Voronoi cells for lattices, revisited
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes
- Scalable revocable identity-based signature over lattices in the standard model
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Lattice Point Enumeration on Block Reduced Bases
- Lattice enumeration using extreme pruning
- Rigorous and Efficient Short Lattice Vectors Enumeration
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Sieve, Enumerate, Slice, and Lift:
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
- Random sampling revisited: lattice enumeration with discrete pruning
- Individual discrete logarithm with sublattice reduction
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Computing efficiently the lattice width in any dimension
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- An ADMM based method for underdetermined box-constrained integer least squares problems
- Quantum lattice enumeration in limited depth
- Giant does not mean strong: cryptanalysis of BQTRU
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- DiTRU: a resurrection of NTRU over dihedral group
- Faster neighbour list generation using a novel lattice vector representation
- Improved (provable) algorithms for the shortest vector problem via bounded distance decoding
- A threshold phenomenon for the shortest lattice vector problem in the infinity norm
- Dual lattice attacks for closest vector problems (with preprocessing)
This page was built for publication: Fast lattice point enumeration with minimal overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363033)
