Low-dimensional lattice basis reduction revisited

DOI10.1145/1597036.1597050zbMath1300.11133OpenAlexW2092901733MaRDI QIDQ2930273

Damien Stehlé, Phong Q. Nguyen

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1597036.1597050

zbMATH Keywords

lattice reductionGauss' algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (17)

A General Algorithm for Calculating Irreducible Brillouin Zones ⋮ On the Successive Minima of Subbases of Low-Dimensional Lattices ⋮ Definite orthogonal modular forms: computations, excursions, and discoveries ⋮ Toroidal fullerenes with the Cayley graph structures ⋮ Tuple lattice sieving ⋮ The irreducible vectors of a lattice: some theory and applications ⋮ Minimal condition for shortest vectors in lattices of low dimension ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction ⋮ Unnamed Item ⋮ AFSRs synthesis with the extended Euclidean rational approximation algorithm ⋮ Sparse non-negative stencils for anisotropic diffusion ⋮ On the complexity of the BKW algorithm on LWE ⋮ Long shortest vectors in low dimensional lattices ⋮ How to pick a random integer matrix? (and other questions) ⋮ Identification protocols and signature schemes based on supersingular isogeny problems ⋮ Lattice size and generalized basis reduction in dimension three ⋮ The use of bad primes in rational reconstruction

This page was built for publication: Low-dimensional lattice basis reduction revisited