Lattice Isomorphism Problem Overview

• Lattice Isomorphism Problem is a decision problem determining if two Euclidean lattices are identical via an orthogonal transformation, equivalent to unimodular congruence of their Gram matrices.
• Efficient n^(O(n))-time algorithms use shortest vectors and successive minima to reveal structural similarities and relate LIP to Graph Isomorphism.
• Generalizations such as lattice distortion and structured arithmetic variants have significant cryptographic and geometric applications.

Searching arXiv for recent and foundational papers on the Lattice Isomorphism Problem. arXiv search query: "Lattice Isomorphism Problem" The Lattice Isomorphism Problem (LIP) is the decision problem of determining whether two lattices are related by an orthogonal linear transformation. In the formulation used by Haviv and Regev, given two lattices $\mathcal{L}_1,\mathcal{L}_2$, one asks whether there exists an orthogonal linear transformation mapping $\mathcal{L}_1$ to $\mathcal{L}_2$ (Haviv et al., 2013). Equivalently, if $G_1,G_2$ are Gram matrices of lattice bases, LIP asks whether there exists a unimodular integer matrix $U$ such that $G_1 = U^T G_2 U$ (Haviv et al., 2013). The problem is routinely described as the lattice analogue of Graph Isomorphism, and its study spans exact isometry testing, quantitative relaxations such as distortion, structured arithmetic variants, and recent cryptographic applications (Bennett et al., 2016).

1. Definition and equivalent formulations

An $n$-dimensional lattice $\mathcal{L}\subset \mathbb{R}^n$ is generated by a basis $B=[\mathbf{b}_1,\dots,\mathbf{b}_n]$ as

$$\mathcal{L}(B)=\left\{\sum_{i=1}^n a_i \mathbf{b}_i : a_i\in\mathbb{Z}\right\}.$$

Two lattices are isomorphic if there exists an orthogonal linear map $\mathcal{L}_1$0 with $\mathcal{L}_1$1 (Haviv et al., 2013). If $\mathcal{L}_1$2 denotes the Gram matrix of a basis, then the orthogonal degrees of freedom can be eliminated: lattice isomorphism is equivalent to unimodular congruence of Gram matrices,

$\mathcal{L}_1$3

which is the discrete formulation emphasized in algorithmic work on LIP (Haviv et al., 2013).

A closely related formulation arises in the Lattice Distortion Problem (LDP). For lattices $\mathcal{L}_1$4, define

$\mathcal{L}_1$5

LDP generalizes LIP because $\mathcal{L}_1$6 if and only if the lattices are isomorphic (Bennett et al., 2016). In this language, LIP is the exact threshold case of a broader metric comparison problem.

The term lattice is potentially ambiguous. In LIP it refers to Euclidean lattices in $\mathcal{L}_1$7. By contrast, other parts of algebra study distributive, congruence, modular, and algebraic lattices as order-theoretic objects. The classification problem for those lattices up to isomorphism was shown to contain the classification problem for pairs of matrices up to simultaneous similarity, and is therefore wild (Lipyanski et al., 2010). This is a different isomorphism problem from Euclidean LIP.

2. Complexity-theoretic status

A foundational result gives an exact algorithm for LIP running in time $\mathcal{L}_1$8 times a polynomial in the input size, where $\mathcal{L}_1$9 is the lattice rank; the algorithm outputs all orthogonal linear transformations mapping one input lattice to the other and uses polynomial space (Haviv et al., 2013). The same work proves that LIP lies in the complexity class $\mathcal{L}_2$0 (Haviv et al., 2013). In subsequent terminology based on LDP, LIP reduces in polynomial time to $\mathcal{L}_2$1-GapLDP, and $\mathcal{L}_2$2-GapLDP is in NP, so LIP is in NP as well (Bennett et al., 2016).

The broader placement of LIP in the isomorphism-problem landscape is shaped by reductions from Graph Isomorphism. Later literature cited in work on lattice distortion and unimodular polytope isomorphism records that Graph Isomorphism reduces to LIP, and correspondingly treats LIP as graph-isomorphism hard (Bennett et al., 2016). This situates LIP with other GI-like problems rather than with NP-hard optimization problems.

Recent progress has identified faster algorithms on restricted classes. For self-dual lattices, a $\mathcal{L}_2$3-time randomized algorithm is known for LIP on a broad class of instances, together with a $\mathcal{L}_2$4 protocol; under a quantitative condition on the reduced rank, the corresponding restricted problem lies in $\mathcal{L}_2$5 (Bennett et al., 17 Jun 2026). This sharpens the general $\mathcal{L}_2$6 bound when strong structural constraints are present.

3. Main algorithmic ideas

The $\mathcal{L}_2$7-time algorithm of Haviv and Regev is organized around shortest vectors, successive minima, and a recursive decomposition by the span of minimal vectors. A crucial ingredient is a generalized isolation lemma that can isolate $\mathcal{L}_2$8 linearly independent vectors in a given subset of $\mathcal{L}_2$9 (Haviv et al., 2013). In the special case where the shortest vectors already span the lattice, this lemma is used to canonically select independent shortest vectors via a short dual vector; in the general case, the algorithm recurses on the orthogonal complement of the span of shortest vectors (Haviv et al., 2013).

The quantitative generalization furnished by LDP replaces exact orthogonal equivalence by low-distortion linear bijections. The distortion between two lattices is approximated, up to an $G_1,G_2$0 factor, by a product of ratios of successive minima, and constructive algorithms compute low-distortion maps within a $G_1,G_2$1 factor of optimal in polynomial time and within an $G_1,G_2$2 factor in singly exponential time (Bennett et al., 2016). These algorithms rely on Seysen’s notion of basis reduction, which is shown to be intimately related to lattice distortion (Bennett et al., 2016). They do not decide exact isomorphism, but they give coarse invariants and one-sided certificates of non-isomorphism when the true distortion is separated from $G_1,G_2$3.

For self-dual lattices, the main structural input is a decomposition

$G_1,G_2$4

where $G_1,G_2$5 is self-dual and satisfies $G_1,G_2$6 (Bennett et al., 17 Jun 2026). The same work exploits characteristic vectors, namely vectors $G_1,G_2$7 such that

$G_1,G_2$8

for every $G_1,G_2$9 (Bennett et al., 17 Jun 2026). The decomposition isolates the $U$0 summand algorithmically, while characteristic vectors furnish non-isomorphism certificates and restricted $U$1 protocols.

4. Generalizations and structured solvable cases

LDP clarifies a sharp complexity separation between exact and approximate comparison. While LIP is treated as GI-like, LDP is NP-hard to approximate within any constant factor under randomized reductions, via reductions from the Shortest Vector Problem (Bennett et al., 2016). This establishes that allowing approximate embeddings changes the complexity landscape substantially.

Another direction studies lattices endowed with additional arithmetic structure. For lattices over CM-orders, Lenstra and Silverberg give a deterministic polynomial-time algorithm for deciding whether two given elements of the Witt-Picard group are equal; equivalently, they solve isomorphism for a highly structured class of invertible lattices over CM-orders (Jr. et al., 2017). Their method uses lattices rather than ideals to avoid coefficient blow-up and relies on a technique introduced by Gentry and Szydlo (Jr. et al., 2017). This is a special-case tractability result for a structured arithmetic analogue of LIP.

A related but more module-theoretic notion of lattice isomorphism appears in work on $U$2-lattices over orders in finite-dimensional algebras. Under the hypothesis that each simple component of the semisimple quotient is a matrix ring over a field, an algorithm decides whether two $U$3-lattices are isomorphic and, if so, computes an explicit isomorphism; the same framework yields an algorithm for the integral matrix similarity problem over $U$4 (Bley et al., 2022). This belongs to the algebraic theory of lattices over orders rather than to Euclidean LIP, but it illustrates how added algebraic structure can make isomorphism algorithmically accessible.

5. Cryptographic relevance and structured hard instances

LIP has been proposed as a foundation for post-quantum cryptography (Nishimura et al., 12 Jul 2025). That has intensified the study of which families of instances genuinely reflect the difficulty of the generic problem. A notable negative result concerns lattices obtained by Construction A from LCD codes. Ducas and Gibbons introduced the hull attack for lattices constructed from LCD codes over finite fields, and later work extended the analysis to codes over finite rings $U$5 (Nishimura et al., 12 Jul 2025).

In that framework, lattices $U$6 are isomorphic if there exists an orthonormal matrix $U$7 such that $U$8, and the special case $U$9 is denoted $G_1 = U^T G_2 U$0LIP (Nishimura et al., 12 Jul 2025). For lattices arising from LCD codes over $G_1 = U^T G_2 U$1, the $G_1 = U^T G_2 U$2-hull

$G_1 = U^T G_2 U$3

reveals the code hull, and this permits a reduction from LIP on these structured instances to $G_1 = U^T G_2 U$4LIP together with graph isomorphism (Nishimura et al., 12 Jul 2025). In particular, when $G_1 = U^T G_2 U$5 is odd, an odd prime power, or even but not divisible by $G_1 = U^T G_2 U$6 under the freeness hypotheses stated there, the resulting LIP instances reduce to $G_1 = U^T G_2 U$7LIP and GI (Nishimura et al., 12 Jul 2025).

This suggests that some code-derived lattice families are too structured to serve as generic hardness sources. The same literature treats this as evidence that LIP-based cryptographic constructions must avoid instance classes whose hull structure collapses the problem to $G_1 = U^T G_2 U$8LIP and graph isomorphism (Nishimura et al., 12 Jul 2025).

6. Related geometric and combinatorial isomorphism problems

Several adjacent isomorphism problems illuminate the position of LIP. For convex lattice polytopes, the unimodular isomorphism problem asks whether two polytopes are related by an affine map $G_1 = U^T G_2 U$9 with $n$0 and $n$1. This problem is graph-isomorphism hard, admits a statistical zero-knowledge proof system inspired by protocols for lattice (non-)isomorphism, and has an algorithm that computes all unimodular affine transformations between two input polytopes (Liu et al., 30 Jun 2025). The comparison is instructive: UIP is a discrete polyhedral analogue of Euclidean lattice isomorphism, but its symmetry group is integral affine rather than orthogonal.

For convex lattice polytopes one also has canonical-form and automorphism-group methods. An algorithmic treatment of lattice isomorphism and affine equivalence for polytopes under $n$2 and $n$3 constructs labeled face graphs, computes automorphism groups, and defines normal forms $n$4 and $n$5 such that equality of normal forms is equivalent to isomorphism or affine equivalence (Grinis et al., 2013). The use of normal forms, labeled graphs, and symmetry-aware search parallels recurring themes in LIP algorithms.

A recurrent misconception is that all “lattice isomorphism” problems belong to one complexity class or one mathematical theory. Euclidean LIP concerns full-rank discrete subgroups of $n$6 under orthogonal transformations (Haviv et al., 2013). Order-theoretic lattice isomorphism concerns partially ordered sets with joins and meets, and its classification theory behaves very differently: for distributive, congruence, modular, and algebraic lattices, the isomorphism problem contains simultaneous similarity of pairs of matrices and is wild (Lipyanski et al., 2010). The shared word lattice masks a substantial conceptual divide.

The current picture is therefore stratified. General Euclidean LIP has exact $n$7 algorithms and $n$8 containment (Haviv et al., 2013); quantitative approximation via distortion is much harder (Bennett et al., 2016); structured arithmetic subclasses can be polynomial-time solvable (Jr. et al., 2017); some structured cryptographic families collapse to $n$9LIP and GI (Nishimura et al., 12 Jul 2025); and restricted self-dual cases admit substantially faster algorithms and stronger proof systems (Bennett et al., 17 Jun 2026). This stratification is central to contemporary work on lattice isomorphism.