On the lattice isomorphism problem

DOI10.1137/1.9781611973402.29MaRDI QIDQ5383988zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the lattice distortion problem
• Zero-knowledge interactive proof systems for new lattice problems
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• Lattices with symmetry
• Computation of lattice isomorphisms and the integral matrix similarity problem

Cited in

(34)

• The variant of remote set problem on lattices
• On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
• General linear group action on tensors: a candidate for post-quantum cryptography
• The parameterized complexity of geometric graph isomorphism
• The isomorphism class of a set of lattices
• scientific article; zbMATH DE number 5657708 (Why is no real title available?)
• scientific article; zbMATH DE number 4073256 (Why is no real title available?)
• On the lattice distortion problem
• Computation of lattice isomorphisms and the integral matrix similarity problem
• Derandomizing isolation in space-bounded settings
• Testing isomorphism of lattices over CM-orders
• Deciding orthogonality in construction-A lattices
• 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
• Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
• Concrete analysis of quantum lattice enumeration
• Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
• Deciding whether a lattice has an orthonormal basis is in co-NP
• Cryptanalysis of rank-2 module-LIP in totally real number fields
• A reduction from Hawk to the principal ideal problem in a quaternion algebra
• Re-randomize and extract: a novel commitment construction framework based on group actions
• Rank-2 module-LIP with special matrices
• Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
• Dense and smooth lattices in any genus
• Cryptanalysis of rank-2 module-LIP with symplectic automorphisms
• On the spinor genus and the distinguishing lattice isomorphism problem
• Relating code equivalence to other isomorphism problems
• Properties of lattice isomorphism as a cryptographic group action
• Fully-homomorphic encryption from lattice isomorphism
• Dimension-reducing algorithms for quaternion ideal-SVP
• On an isomorphism problem on the closed-set lattice of a graph

This page was built for publication: On the lattice isomorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383988)