On the Lattice Isomorphism Problem

DOI10.1137/1.9781611973402.29zbMath1421.68085OpenAlexW1890636210MaRDI QIDQ5383988

Ishay Haviv, Oded Regev

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (10)

The parameterized complexity of geometric graph isomorphism ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Hull attacks on the lattice isomorphism problem ⋮ Kneser's method of neighbors ⋮ Take your MEDS: digital signatures from matrix code equivalence ⋮ Genus distribution of random $q$-ary lattices ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ Deciding Orthogonality in Construction-A Lattices

This page was built for publication: On the Lattice Isomorphism Problem