Paper 2025/227

Two Is All It Takes: Asymptotic and Concrete Improvements for Solving Code Equivalence

Abstract

The Linear Code Equivalence ($\mathsf{LCE}$) problem asks, for two given linear codes $\mathcal{C},{\mathcal{C}}^{\prime }$, to find a monomial $\mathbf{Q}$ mapping $\mathcal{C}$ into ${\mathcal{C}}^{\prime }$. Algorithms solving $\mathsf{LCE}$ crucially rely on a (heuristic) subroutine, which recovers the secret monomial from $$ pairs of codewords $$ satisfying $$. We greatly improve on this known bound by giving a constructive (heuristic) algorithm that recovers the secret monomial from any \emph{two} pairs of such codewords for any $$. We then show that this reduction in the number of required pairs enables the design of a more efficient algorithm for solving the $$ problem. Our asymptotic analysis shows that this algorithm outperforms previous approaches for a wide range of parameters, including all parameters proposed across the literature. Furthermore, our concrete analysis reveals significant bit security reductions for suggested parameters. Most notably, in the context of the LESS signature scheme, a second-round contender in the ongoing NIST standardization effort for post-quantum secure digital signatures, we obtain bit security reductions of up to 24 bits.