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. We give a definition of the reduced basis which is equivalent to that of the Minkowski reduced basis of a 3-dimensional lattice. We prove that for b1, b2, b3 ∈ Zn, n ≥ 3 and |b1|, |b2|, |b3| ≤ M, our algorithm takes O(log2M) binary operations, without using fast integer arithmetic, to reduce this basis and so to find the shortest vector in the lattice. The definition and the algorithm can be extended to any dimension. Elementary steps of our algorithm are rather different from those of the LLL-algorithm, which works in O(log3M) binary operations without using fast integer arithmetic.
CITATION STYLE
Semaev, I. (2001). A 3-dimensional lattice reduction algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2146, pp. 181–193). Springer Verlag. https://doi.org/10.1007/3-540-44670-2_13
Mendeley helps you to discover research relevant for your work.