On the lattice isomorphism problem

Ishay Haviv, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the Lattice Isomorphism Problem (LIP), in which given two lattices L1 and L2 the goal is to decide whether there exists an orthogonal linear transformation mapping L1 to L2. Our main result is an algorithm for this problem running in time n O(n)times a polynomial in the input size, where n is the rank of the input lattices. A crucial component is a new generalized isolation lemma, which can isolate n linearly independent vectors in a given subset of Zn and might be useful elsewhere. We also prove that LIP lies in the complexity class SZK.

Original languageEnglish (US)
Title of host publicationProceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
PublisherAssociation for Computing Machinery
Pages391-404
Number of pages14
ISBN (Print)9781611973389
StatePublished - Jan 1 2014
Event25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 - Portland, OR, United States
Duration: Jan 5 2014Jan 7 2014

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Other

Other25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014
CountryUnited States
CityPortland, OR
Period1/5/141/7/14

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'On the lattice isomorphism problem'. Together they form a unique fingerprint.

  • Cite this

    Haviv, I., & Regev, O. (2014). On the lattice isomorphism problem. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 (pp. 391-404). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery.