Pages that link to "Item:Q2096521"

The following pages link to Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521):

Displayed 7 items.

• On bounded distance decoding with predicate: breaking the ``lattice barrier'' for the hidden number problem (Q2056699) ‎ (← links)
• The convergence of slide-type reductions (Q2061912) ‎ (← links)
• Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) ‎ (← links)
• Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance (Q2128583) ‎ (← links)
• Towards faster polynomial-time lattice reduction (Q2128584) ‎ (← links)
• Improving convergence and practicality of slide-type reductions (Q2687993) ‎ (← links)
• A lattice reduction algorithm based on sublattice BKZ (Q2697920) ‎ (← links)