License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2015.151
URN: urn:nbn:de:0030-drops-56509
URL: http://drops.dagstuhl.de/opus/volltexte/2015/5650/
Go to the corresponding LIPIcs Volume Portal


Chandrasekaran, Karthekeyan ; Gandikota, Venkata ; Grigorescu, Elena

Deciding Orthogonality in Construction-A Lattices

pdf-format:
36.pdf (0.4 MB)


Abstract

Lattices are discrete mathematical objects with widespread applications to integer programs as well as modern cryptography. A fundamental problem in both domains is the Closest Vector Problem (popularly known as CVP). It is well-known that CVP can be easily solved in lattices that have an orthogonal basis if the orthogonal basis is specified. This motivates the orthogonality decision problem: verify whether a given lattice has an orthogonal basis. Surprisingly, the orthogonality decision problem is not known to be either NP-complete or in P. In this paper, we focus on the orthogonality decision problem for a well-known family of lattices, namely Construction-A lattices. These are lattices of the form C + qZ^n, where C is an error-correcting q-ary code, and are studied in communication settings. We provide a complete characterization of lattices obtained from binary and ternary codes using Construction- A that have an orthogonal basis. This characterization leads to an efficient algorithm solving the orthogonality decision problem, which also finds an orthogonal basis if one exists for this family of lattices. We believe that these results could provide a better understanding of the complexity of the orthogonality decision problem in general.

BibTeX - Entry

@InProceedings{chandrasekaran_et_al:LIPIcs:2015:5650,
  author =	{Karthekeyan Chandrasekaran and Venkata Gandikota and Elena Grigorescu},
  title =	{{Deciding Orthogonality in Construction-A Lattices}},
  booktitle =	{35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
  pages =	{151--162},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-97-2},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{45},
  editor =	{Prahladh Harsha and G. Ramalingam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5650},
  URN =		{urn:nbn:de:0030-drops-56509},
  doi =		{10.4230/LIPIcs.FSTTCS.2015.151},
  annote =	{Keywords: Orthogonal Lattices, Construction-A, Orthogonal Decomposition, Lattice isomorphism}
}

Keywords: Orthogonal Lattices, Construction-A, Orthogonal Decomposition, Lattice isomorphism
Seminar: 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)
Issue Date: 2015
Date of publication: 11.12.2015


DROPS-Home | Imprint | Privacy Published by LZI