1 research outputs found
On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields
In this paper, we continue our previous work on the reduction of algebraic
lattices over imaginary quadratic fields for the special case when the lattice
is spanned over a two dimensional basis. In particular, we show that the
algebraicvariant of Gauss algorithm returns a basis that corresponds to the
successive minima of the lattice in polynomial time if the chosen ring is
Euclidean.Comment: Conference paper in preprint, submitted to ITW 2019. arXiv admin
note: text overlap with arXiv:1806.0311