Notes on the generalized Gauss reduction algorithm

DOI10.32523/2077-9879-2025-16-2-23-29MaRDI QIDQ6925528zbMATH OpenFDO

Authors Yerzhan Baisalov, Ruslan Nauryzbaev

Publication date 25 September 2025

Published in Eurasian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.32523/2077-9879-2025-16-2-23-29

zbMATH Keywords

generalized Gaussian algorithmlatticereduced basiswell-ordered basis

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• scientific article; zbMATH DE number 1775383 (Why is no real title available?)
• scientific article; zbMATH DE number 1857498 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• Low-dimensional lattice basis reduction revisited
• On lattices, learning with errors, random linear codes, and cryptography
• The Generalized Gauss Reduction Algorithm
• The shortest vector in a lattice is hard to approximate to within some constant

This page was built for publication: Notes on the generalized Gauss reduction algorithm

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