Pages that link to "Item:Q2985850"
From MaRDI portal
The following pages link to Faster LLL-type Reduction of Lattice Bases (Q2985850):
Displaying 15 items.
- 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)
- Optimal systems of fundamental \(S\)-units for LLL-reduction (Q987569) (← links)
- Segment LLL reduction of lattice bases using modular arithmetic (Q1662551) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) (Q2096521) (← links)
- Towards faster polynomial-time lattice reduction (Q2128584) (← links)
- A new polynomial-time variant of LLL with deep insertions for decreasing the squared-sum of Gram-Schmidt lengths (Q2329392) (← links)
- Bounding basis reduction properties (Q2364641) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Reduction of lattice bases for arbitrary norms (Q2800006) (← links)
- (Q4230368) (← links)
- A Verified Efficient Implementation of the LLL Basis Reduction Algorithm (Q5222951) (← links)
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange (Q6135458) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
