Pages that link to "Item:Q4711415"
From MaRDI portal
The following pages link to A more efficient algorithm for lattice basis reduction (Q4711415):
Displayed 12 items.
- Simultaneously good bases of a lattice and its reciprocal lattice (Q1119682) (← links)
- Improved low-density subset sum algorithms (Q1207335) (← links)
- Simultaneous reduction of a lattice basis and its reciprocal basis (Q1311020) (← links)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems (Q1340057) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Fast LLL-type lattice reduction (Q2490117) (← links)
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Collision-Free Hashing from Lattice Problems (Q3088173) (← links)
- Analysis of PSLQ, an integer relation finding algorithm (Q4221985) (← links)
- Improved Rounding for Spline Coefficients and Knots (Q4305975) (← links)
- Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
- A Digital Signature Scheme Based on CVP ∞ (Q5445459) (← links)