Pages that link to "Item:Q2096526"
From MaRDI portal
The following pages link to Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526):
Displayed 14 items.
- A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP (Q2056696) (← links)
- Advanced lattice sieving on GPUs, with tensor cores (Q2056731) (← links)
- The convergence of slide-type reductions (Q2061912) (← links)
- On the success probability of solving unique SVP via BKZ (Q2061913) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP (Q2096523) (← links)
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- Dynamic self-dual DeepBKZ lattice reduction with free dimensions and its implementation (Q2231762) (← links)
- Improving convergence and practicality of slide-type reductions (Q2687993) (← links)
- A lattice reduction algorithm based on sublattice BKZ (Q2697920) (← links)
- Subfield attacks on HSVP in ideal lattices (Q6134036) (← links)
- On module unique-SVP and NTRU (Q6135456) (← links)