Abstract

The ${\mathbb{Z}^n}$ lattice is the lattice generated by the set of all orthogonal unit integer vectors. Since it has an orthonormal basis, the shortest vector problem and the closest vector problem are easy to solve in this particular lattice. But, these problems are hard to solve when we consider a rotation of ${\mathbb{Z}^n}$ lattice. In-fact, even though it is known that the ${\mathbb{Z}^n}$-isomorphism problem is in NP ∩ Co-NP, we still don’t have an efficient algorithm to solve it. Motivated by the above, in this paper we investigate the properties of the bases of ${\mathbb{Z}^n}$ lattice which are the sets of column/row vectors of unimodular matrices. We show that an integer primitive vector of norm strictly greater than 1 can be extended to a unimodular matrix U such that the remaining vectors have norm strictly smaller than the initial primitive vector. We also show a reduction from SVP in any lattice isomorphic to ${\mathbb{Z}^n}$ to SVP in n − 1 dimensional sublattice of ${\mathbb{Z}^n}$. We define two new classes of lattice bases and show certain results related to ${\mathbb{Z}^n}$ bases. Finally, we study the relation between any solution to Successive Minima Problem and the set of Voronoi relevant vectors and present some bounds related to the compact bases of ${\mathbb{Z}^n}$.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.