An Efficient Algorithm for Integer Lattice Reduction

DOI10.1137/23m1557933arXiv2303.02226WikidataQ129446300 ScholiaQ129446300MaRDI QIDQ6154950

Mark Tygert, Cathy Li, Kristin E. Lauter, Unnamed Author

Publication date: 16 February 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.02226

zbMATH Keywords

optimizationcryptographyprojectionorthogonalizationmatrixnumber theory

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• New bounds in some transference theorems in the geometry of numbers
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• An introduction to the geometry of numbers.
• A Decade of Lattice Cryptography
• Gram-Schmidt orthogonalization: 100 years and more
• Basic Linear Algebra Subprograms for Fortran Usage
• Floating-Point LLL: Theoretical and Practical Aspects
• An updated set of basic linear algebra subprograms (BLAS)
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item

This page was built for publication: An Efficient Algorithm for Integer Lattice Reduction