Pages that link to "Item:Q5738781"
From MaRDI portal
The following pages link to Improved Algorithms for the Approximate k-List Problem in Euclidean Norm (Q5738781):
Displaying 9 items.
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier (Q2055682) (← 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)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Sieve, Enumerate, Slice, and Lift: (Q5048976) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems (Q6644081) (← links)
