Pages that link to "Item:Q1784109"
From MaRDI portal
The following pages link to Lower bounds on lattice enumeration with extreme pruning (Q1784109):
Displaying 7 items.
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Lattice Enumeration Using Extreme Pruning (Q3563839) (← links)
- A Survey of Solving SVP Algorithms and Recent Strategies for Solving the SVP Challenge (Q4964363) (← links)
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning (Q5738970) (← links)
- Quantum lattice enumeration in limited depth (Q6652982) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)