Pages that link to "Item:Q2128584"
From MaRDI portal
The following pages link to Towards faster polynomial-time lattice reduction (Q2128584):
Displaying 10 items.
- An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Faster LLL-type Reduction of Lattice Bases (Q2985850) (← links)
- Lattice Reduction Algorithms: Theory and Practice (Q3003370) (← links)
- Lattice Reduction for Modular Knapsack (Q3455505) (← links)
- (Q4230368) (← links)
- (Q4409156) (← links)
- Improved computation of polynomial roots over number fields when using complex embeddings (Q6671812) (← links)
