Deciding Orthogonality in Construction-A Lattices

DOI10.1137/15M1054766zbMath1430.94102MaRDI QIDQ5270405

Karthekeyan Chandrasekaran, Elena Grigorescu, Venkata Gandikota

Publication date: 23 June 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

lattice isomorphismorthogonal latticesconstruction-A lattices

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Other types of codes (94B60) Matrices of integers (15B36)

Related Items (2)

Sieve algorithms for some orthogonal integer lattices ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Computing isometries of lattices
• Lattices with symmetry
• Factoring Integers by CVP Algorithms
• Revisiting the Gentry-Szydlo Algorithm
• Complexity and algorithms for computing Voronoi cells of lattices
• Lattice-based Cryptography
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• On the Lattice Isomorphism Problem

This page was built for publication: Deciding Orthogonality in Construction-A Lattices