Finding the permutation between equivalent linear codes: the support splitting algorithm
From MaRDI portal
Publication:4501759
DOI10.1109/18.850662zbMath1002.94037OpenAlexW2119117325MaRDI QIDQ4501759
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.850662
signaturelinear codesweight enumeratorinvarianthullpermutation-equivalent codessupport splitting algorithm
Related Items (72)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness ⋮ Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ A Summary of McEliece-Type Cryptosystems and their Security ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes ⋮ On Binary Linear Codes Whose Automorphism Group is Trivial ⋮ New Galois hulls of generalized Reed-Solomon codes ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Hulls of cyclic serial codes over a finite chain ring ⋮ Unnamed Item ⋮ MDS codes with euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Optimal quaternary linear codes with one-dimensional Hermitian hull and related EAQECCs ⋮ Hull attacks on the lattice isomorphism problem ⋮ On Toeplitz codes of index \(t\) and isometry codes ⋮ An improved method for constructing formally self-dual codes with small hulls ⋮ On MDS codes with Galois hulls of arbitrary dimensions ⋮ New MDS entanglement-assisted quantum codes from MDS Hermitian self-orthogonal codes ⋮ On the computational hardness of the code equivalence problem in cryptography ⋮ A new algorithm for equivalence of cyclic codes and its applications ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ Several classes of Galois self-orthogonal MDS codes and related applications ⋮ An attack on a non-interactive key exchange from code equivalence ⋮ Galois hulls of constacyclic codes over finite fields ⋮ On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\) ⋮ Linear codes of larger lengths with Galois hulls of arbitrary dimensions and related entanglement-assisted quantum error-correcting codes ⋮ On LCD codes from skew symmetric Toeplitz matrices ⋮ On generalized monomial codes defined over sets with a special vanishing ideal ⋮ Good integers and some applications in coding theory ⋮ Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs ⋮ Optimal quaternary Hermitian LCD codes and their related codes ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ McEliece Cryptosystem Implementation: Theory and Practice ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes ⋮ Quantum Resistant Public Key Encryption Scheme polarRLCE ⋮ LCD codes from tridiagonal Toeplitz matrices ⋮ Unnamed Item ⋮ A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography ⋮ Hulls of cyclic and negacyclic codes over finite fields ⋮ Constructions and bounds on quaternary linear codes with Hermitian hull dimension one ⋮ The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order ⋮ Hulls of cyclic codes over \(\mathbb{Z}_4\) ⋮ Linear codes with one-dimensional hull associated with Gaussian sums ⋮ Characteristic vector and weight distribution of a linear code ⋮ Galois hulls of linear codes over finite fields ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ Схема разделения секрета типа схемы Блэкли, основанная на пересечении подпространств ⋮ Wild McEliece ⋮ Optimal binary and ternary linear codes with hull dimension one ⋮ Hulls of linear codes revisited with applications ⋮ The average dimension of the hull of cyclic codes. ⋮ On a Gröbner bases structure associated to linear codes ⋮ Wild McEliece Incognito ⋮ On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1} ⋮ On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes ⋮ Hermitian hulls of constacyclic codes and a new family of entanglement-assisted quantum MDS codes ⋮ Constructions of linear codes with small hulls from association schemes ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ MDS linear codes with one-dimensional hull ⋮ Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property ⋮ Linear codes with small hulls in semi-primitive case ⋮ A new construction of linear codes with one-dimensional hull ⋮ Computing an Invariant of a Linear Code ⋮ Linear codes with arbitrary dimensional hull and their applications to EAQECCs ⋮ A new method for constructing linear codes with small hulls ⋮ Hermitian hulls of constacyclic codes and their applications to quantum codes ⋮ LESS-FM: fine-tuning signatures from the code equivalence problem
This page was built for publication: Finding the permutation between equivalent linear codes: the support splitting algorithm
