An efficient lattice reduction using reuse technique blockwisely on NTRU

DOI10.1016/j.dam.2016.05.029zbMath1409.94938OpenAlexW2473908394MaRDI QIDQ317407

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

zbMATH Keywords

LLL algorithmiLLL algorithmNTRU latticereuse technique

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Combinatorial codes (94B25)

Uses Software

• SageMath
• BKZ
• NTRU

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
• Factoring polynomials with rational coefficients
• Neural ideals in SageMath
• Worst-case to average-case reductions for module lattices
• An Introduction to Mathematical Cryptography
• BKZ 2.0: Better Lattice Security Estimates
• An LLL Algorithm with Quadratic Complexity
• A more efficient algorithm for lattice basis reduction
• Floating-Point LLL Revisited