An efficient lattice reduction using reuse technique blockwisely on NTRU
From MaRDI portal
(Redirected from Publication:317407)
Recommendations
- A more efficient algorithm for lattice basis reduction
- scientific article; zbMATH DE number 3958726
- Efficient lattice reduction updating and downdating methods and analysis
- scientific article; zbMATH DE number 1186952
- scientific article; zbMATH DE number 1263369
- Lattice Reduction Algorithms: Theory and Practice
- A new parallel lattice reduction algorithm for BKZ reduced bases
- Towards faster polynomial-time lattice reduction
- Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- A more efficient algorithm for lattice basis reduction
- An LLL algorithm with quadratic complexity
- An introduction to mathematical cryptography
- BKZ 2.0: Better lattice security estimates
- Factoring polynomials with rational coefficients
- Floating-Point LLL Revisited
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Lattice basis reduction. An introduction to the LLL algorithm and its applications
- Neural ideals in SageMath
- Worst-case to average-case reductions for module lattices
Cited in
(5)
This page was built for publication: An efficient lattice reduction using reuse technique blockwisely on NTRU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317407)