Pages that link to "Item:Q2128583"
From MaRDI portal
The following pages link to Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583):
Displaying 10 items.
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- \(\mathsf{Rubato}\): noisy ciphers for approximate homomorphic encryption (Q2170018) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- Lattice Reduction Algorithms: Theory and Practice (Q3003370) (← links)
- Development and analysis of massive parallelization of a lattice basis reduction algorithm (Q6139332) (← links)
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices (Q6487348) (← links)
- Concrete analysis of quantum lattice enumeration (Q6595811) (← links)
- Quantum lattice enumeration in limited depth (Q6652982) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
