On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields

04/10/2019

∙

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.

READ FULL TEXT

On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields

Performance Limits of Lattice Reduction over Imaginary Quadratic Fields with Applications to Compute-and-Forward

Deciding whether a Lattice has an Orthonormal Basis is in co-NP

On the High Dimensional RSA Algorithm – A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory

Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond

Some Properties of Successive Minima and Their Applications

Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission

Reduction Theory of Algebraic Modules and their Successive Minima

On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields

Related Research

Performance Limits of Lattice Reduction over Imaginary Quadratic Fields with Applications to Compute-and-Forward

Deciding whether a Lattice has an Orthonormal Basis is in co-NP

On the High Dimensional RSA Algorithm – A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory

Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond

Some Properties of Successive Minima and Their Applications

Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission

Reduction Theory of Algebraic Modules and their Successive Minima