An efficient lattice reduction using reuse technique blockwisely on NTRU
From MaRDI portal
Publication:317407
DOI10.1016/J.DAM.2016.05.029zbMATH Open1409.94938OpenAlexW2473908394MaRDI QIDQ317407FDOQ317407
Kyungmi Chung, Seongan Lim, Hyang-Sook Lee
Publication date: 30 September 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.05.029
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
- 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)
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- BKZ 2.0: Better Lattice Security Estimates
- Title not available (Why is that?)
- Neural ideals in SageMath
- Factoring polynomials with rational coefficients
- Title not available (Why is that?)
- Worst-case to average-case reductions for module lattices
- An Introduction to Mathematical Cryptography
- Title not available (Why is that?)
- An LLL Algorithm with Quadratic Complexity
- A more efficient algorithm for lattice basis reduction
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Floating-Point LLL Revisited
Cited In (2)
Uses Software
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)
