Low-dimensional lattice basis reduction revisited

@article{Nguyen2009LowdimensionalLB,
  title={Low-dimensional lattice basis reduction revisited},
  author={Phong Q. Nguyen and Damien Stehl{\'e}},
  journal={ACM Trans. Algorithms},
  year={2009},
  volume={5},
  pages={46:1-46:48}
}
Lattice reduction is a geometric generalization of the problem of computing greatest common divisors. Most of the interesting algorithmic problems related to lattice reduction are NP-hard as the lattice dimension increases. This article deals with the low-dimensional case. We study a greedy lattice basis reduction algorithm for the Euclidean norm, which is arguably the most natural lattice basis reduction algorithm because it is a straightforward generalization of an old two-dimensional… Expand
Lattice Size and Generalized Basis Reduction in Dimension Three
The lattice size of a lattice polytope P was defined and studied by Schicho, and Castryck and Cools. They provided an “onion skins” algorithm for computing the lattice size of a lattice polygon P inExpand
Minimal condition for shortest vectors in lattices of low dimension
TLDR
A minimal sufficient condition, APG+, is presented for a five dimensional lattice basis to achieve the first minimum in the sense that any proper subset of the required inequalities is not sufficient to achieveThe first minimum. Expand
The irreducible vectors of a lattice: Some theory and applications
TLDR
This work gives a concrete definition of an irreducible vector and study the properties of the set of all such vectors, which is a subset of theSet of relevant vectors and study its properties, which may provide further insights into lattice algorithms and motivate new research into understanding these algorithms better. Expand
On Near Optimal Lattice Quantization of Multi‐Dimensional Data Points
TLDR
Methods for finding parameters for s‐dimensional maximized minimum distance rank‐1 lattices are presented and further show their practical use in computer graphics applications. Expand
Practical, Predictable Lattice Basis Reduction
TLDR
It is concluded that in order to predict lattice reduction, simulation is superfluous and can be replaced by a closed formula using weaker assumptions, which is a novel algorithm to solve the Shortest Vector Problem SVP in the dual without computing the dual basis. Expand
! ! ! ! ! ! ! ! ! ! A Hybrid Method for Lattice Basis Reduction ! ! by !
Lattice reduction has a wide range of applications. In this paper, we first present a polynomial time Jacobi method for lattice basis reduction by modifying the condition for the Lagrange reductionExpand
On the Successive Minima of Subbases of Low-Dimensional Lattices
In this paper we discuss the global optimality of vector lengths for lattice bases. By introducing a partial order on lattice bases and the concept of successive minimal basis (SMB for short), weExpand
On Solving the Shortest Basis Problem Based on Sequential Reduction
  • Shanxiang Lyu, Zheng Wang, Ling Liu
  • Computer Science
  • IEEE Communications Letters
  • 2021
TLDR
This work proposes to employ successive interference cancellation (SIC) as a subroutine inside SR, and the whole algorithm is referred to as SR-SIC, and it is proved that the upper bound on the basis length of SR- SIC is better than those of major Lenstra, Lenstra- and Lovász (LLL) based variants when the dimension of the lattice basis is no larger than 4. Expand
Tuple lattice sieving
TLDR
This work generalizes sieving algorithms to solve SVP with less memory by considering reductions of tuples of vectors rather than pairs of vectors as existing sieve algorithms do, and conjecture how this provides a continuous trade-off between the memory-intensive sieving and the asymptotically slower enumeration. Expand
Réseaux Euclidiens : Algorithmes et Cryptographie Euclidean Lattices: Algorithms and Cryptography
Euclidean lattices are a rich algebraic object that occurs in a wide variety of contexts in mathematics and in computer science. The present thesis considers several algorithmic aspects of lattices.Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 82 REFERENCES
Low-Dimensional Lattice Basis Reduction Revisited
TLDR
The analysis, based on geometric properties of low-dimensional lattices and in particular Voronoi cells, arguably simplifies Semaev’s analysis in dimensions two and three, and unifies the cases of dimensions two, three and four, but breaks down in dimension five. Expand
Low-Dimensional Lattice Basis Reduction Revisited ( Extended Abstract )
Most of the interesting algorithmic problems in the geometry of numbers are NP-hard as the lattice dimension increases. This article deals with the low-dimensional case. We study a greedy latticeExpand
Generating hard instances of lattice problems (extended abstract)
  • M. Ajtai
  • Mathematics, Computer Science
  • STOC '96
  • 1996
We give a random class of lattices in Zn whose elements can be generated together with a short vector in them so that, if there is a probabilistic polynomial time algorithm which finds a short vectorExpand
Another View of the Gaussian Algorithm
TLDR
This work introduces here a rewrite system in the group of unimodular matrices, i.e., matrices with integer entries and with determinant equal to ± 1, to precisely characterize the mechanism of the Gaussian algorithm, that finds shortest vectors in a two–dimensional lattice given by any basis. Expand
A 3-Dimensional Lattice Reduction Algorithm
  • I. Semaev
  • Mathematics, Computer Science
  • CaLC
  • 2001
TLDR
The aim of this paper is a reduction algorithm for a basis b1, b2, b3 of a 3-dimensional lattice in Rn for fixed n ≥ 3 that takes O(log2M) binary operations, without using fast integer arithmetic, to reduce this basis and so to find the shortest vector in the lattice. Expand
On Lovász’ lattice reduction and the nearest lattice point problem
  • L. Babai
  • Mathematics, Computer Science
  • Comb.
  • 1986
Answering a question of Vera Sós, we show how Lovász’ lattice reduction can be used to find a point of a given lattice, nearest within a factor ofcd (c = const.) to a given point in Rd. We prove thatExpand
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms
  • C. Schnorr
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1987
TLDR
An algorithm which for k?N finds a nonzero lattice vector b so that |b|2?(6k2)nk?(L)2, and successively applies Korkine?Zolotareff reduction to blocks of length k of the lattice basis. Expand
Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases
TLDR
This paper presents an algorithm to solve the problem of constructing Minkowski reduced lattice bases for arbitrary dimension, which hinges on the previous reduction algorithms of Lenstra, Lenstra and Lovasz and Kannan. Expand
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
  • M. Ajtai
  • Computer Science, Mathematics
  • STOC '98
  • 1998
TLDR
There is a prob-abilistic Turing-machine which in polynomial time reduces any problem in NP to instances of the shortest vector problem, provided that it can use an oracle which returns the solution of the longest vector problem if an instance of it is presented (by giving a basis of the corresponding lattice). Expand
Worst-Case Complexity of the Optimal LLL Algorithm
  • A. Akhavi
  • Mathematics, Computer Science
  • LATIN
  • 2000
TLDR
This paper proves that, for any fixed dimensionn, the number of iterations of the LLL algorithm is linear with respect to the size of the input, and it is easy to deduce that the linear order is optimal. Expand
...
1
2
3
4
5
...