The following pages link to Progressive lattice sieving (Q1644775):
Displaying 10 items.
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Approximate Voronoi cells for lattices, revisited (Q2027268) (← links)
- On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Worst case short lattice vector enumeration on block reduced bases of arbitrary blocksizes (Q2306599) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)