An experimental comparison of some LLL-type lattice basis reduction algorithms

DOI10.1007/s40819-014-0023-5zbMath1392.11097OpenAlexW1975398469MaRDI QIDQ722627

Dimitris G. Papachristoudis, Spyros T. Halkidis, George Stephanides

Publication date: 27 July 2018

Published in: International Journal of Applied and Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40819-014-0023-5

zbMATH Keywords

LLLlattice basis reduction\(L^2\)buffered transformations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)

Uses Software

• SageMath
• NTRU
• Python

Cites Work

• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• An Efficient LLL Gram Using Buffered Transformations
• Post-Quantum Cryptography
• An LLL Algorithm with Quadratic Complexity
• Floating-Point LLL Revisited
• An LLL-reduction algorithm with quasi-linear time complexity
• An Introduction to Mathematical Cryptography
• Heuristics on lattice basis reduction in practice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An experimental comparison of some LLL-type lattice basis reduction algorithms