A Vectorized, Cache Efficient LLL Implementation
From MaRDI portal
Cites work
- Factoring polynomials with rational coefficients
- Floating-Point LLL Revisited
- Floating-Point LLL: Theoretical and Practical Aspects
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Segment LLL-reduction of lattice bases
- Segment LLL-reduction with floating point orthogonalization
This page was built for publication: A Vectorized, Cache Efficient LLL Implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862555)