Pages that link to "Item:Q5419110"

The following pages link to An LLL-reduction algorithm with quasi-linear time complexity (Q5419110):

Displaying 18 items.

• PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
• On the modular inversion hidden number problem (Q412197) (← links)
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
• An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
• Modular polynomials on Hilbert surfaces (Q784730) (← links)
• Optimal systems of fundamental \(S\)-units for LLL-reduction (Q987569) (← links)
• On the computation of the HNF of a module over the ring of integers of a number field (Q1711990) (← links)
• Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
• Revisiting orthogonal lattice attacks on approximate common divisor problems (Q2118873) (← links)
• On the quantum complexity of the continuous hidden subgroup problem (Q2119017) (← links)
• Towards faster polynomial-time lattice reduction (Q2128584) (← links)
• Storage efficient algorithm for Hermite normal form using LLL (Q2229458) (← links)
• Bounding basis reduction properties (Q2364641) (← links)
• Analysis of the upper bound on the complexity of LLL algorithm (Q2817576) (← links)
• Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
• Constructing totally p-adic numbers of small height (Q5069076) (← links)
• A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
• Deterministic factoring with oracles (Q6115442) (← links)