Gauss' algorithm revisited

DOI10.1016/0196-6774(91)90033-UMaRDI QIDQ3988821zbMATH OpenFDO

Authors Brigitte Vallée

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(91)90033-U

zbMATH Keywords

Gauss' reduction algorithmlattice basis reductionrelations to Euclid's algorithm and the LLL reduction algorithmupper bound

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The Generalized Gauss Reduction Algorithm
• Lattice basis reduction. An introduction to the LLL algorithm and its applications
• scientific article; zbMATH DE number 799773
• scientific article; zbMATH DE number 3972987
• Probabilistic Analyses of Lattice Reduction Algorithms

Cited in

(15)

• An upper bound on the average number of iterations of the LLL algorithm
• The optimal LLL algorithm is still polynomial in fixed dimension.
• Satins, lattices, and extended Euclid's algorithm
• How to pick a random integer matrix? (and other questions)
• Revisiting the Gentry-Szydlo Algorithm
• Linear Bandwidth Naccache-Stern Encryption
• scientific article; zbMATH DE number 3977090 (Why is no real title available?)
• The Generalized Gauss Reduction Algorithm
• Computing Jacobi's theta in quasi-linear time
• On pairwise Gaussian bases and LLL algorithm for three dimensional lattices
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
• An affine point of view on minima finding in integer lattices of lower dimensions
• LATIN 2004: Theoretical Informatics
• Convex minization over \(\mathbb Z^2\)
• Parallel Cholesky-based reduction for the weighted integer least squares problem

This page was built for publication: Gauss' algorithm revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988821)