Pages that link to "Item:Q1749295"
From MaRDI portal
The following pages link to Fast lattice basis reduction suitable for massive parallelization and its application to the shortest vector problem (Q1749295):
Displaying 8 items.
- Shortest vector from lattice sieving: a few dimensions for free (Q1648783) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (Q2329392) (← links)
- NFLlib: NTT-Based Fast Lattice Library (Q2799029) (← links)
- A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices (Q3100319) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Learning strikes again: the case of the DRS signature scheme (Q5918281) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
