Finding the permutation between equivalent linear codes: the support splitting algorithm
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Semantic security for the McEliece cryptosystem without random oracles
- Good integers and some applications in coding theory
- The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order
- The average dimension of the hull of cyclic codes.
- LCD codes from tridiagonal Toeplitz matrices
- Hulls of cyclic and negacyclic codes over finite fields
- Constructions and bounds on quaternary linear codes with Hermitian hull dimension one
- Linear codes with one-dimensional hull associated with Gaussian sums
- Characteristic vector and weight distribution of a linear code
- Optimal binary and ternary linear codes with hull dimension one
- Hulls of linear codes revisited with applications
- 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
- MDS linear codes with one-dimensional hull
- A new construction of linear codes with one-dimensional hull
- 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
- Structural properties of self-dual monomial codes with application to code-based cryptography
- 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 codes over \(\mathbb{Z}_4\)
- Galois hulls of linear codes over finite fields
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- 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
- Computational aspects of retrieving a representation of an algebraic geometry code
- Structural cryptanalysis of McEliece schemes with compact keys
- Hulls of cyclic serial codes over a finite chain ring
- An attack on a non-interactive key exchange from code equivalence
- Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs
- Optimal quaternary Hermitian LCD codes and their related codes
- Wild McEliece
- Wild McEliece Incognito
- On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes
- Quantum resistant public key encryption scheme polarRLCE
- Blakley type secret sharing scheme based on the intersection of subspaces
- McEliece Cryptosystem Implementation: Theory and Practice
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- On a Gröbner bases structure associated to linear codes
- scientific article; zbMATH DE number 1855641 (Why is no real title available?)
- scientific article; zbMATH DE number 1880283 (Why is no real title available?)
- Computing an invariant of a linear code
- LESS is more: code-based signatures without syndromes
- scientific article; zbMATH DE number 7622441 (Why is no real title available?)
- Cryptanalysis of the BBCRS system on Reed-Muller binary code
- On binary linear codes whose automorphism group is trivial
- On the equivalence of cyclic and quasi-cyclic codes over finite fields
- A Summary of McEliece-Type Cryptosystems and their Security
- Oblivious Transfer Based on the McEliece Assumptions
- A NP-complete problem in coding theory with application to code based cryptography
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- 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
- 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
- Hulls of linear codes from simplex codes
- Additive one-rank hull codes over finite fields
- Explicit non-special divisors of small degree, algebraic geometric hulls, and LCD codes from Kummer extensions
- Hermitian hull of constacyclic codes over a class of non-chain rings and new quantum codes
- MDS codes with \(l\)-Galois hulls of arbitrary dimensions
- Monomial isomorphism for tensors and applications to code equivalence problems
- On Bose distance of a class of BCH codes with two types of designed distances
- On two modifications of the McEliece PKE and the CFS signature scheme
- MDS multi-twisted Reed-Solomon codes with small dimensional hull
- On cyclic and negacyclic codes with one-dimensional hulls and their applications
- On symplectic hulls of linear codes and related applications
- A new formulation of the linear equivalence problem and shorter less signatures
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- A note on the hull and linear complementary pair of cyclic codes
- New and improved formally self-dual codes with small hulls from polynomial four Toeplitz codes
- Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
- The number of codes over rings of order 4 containing a hull of given type
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- On abelian one-dimensional hull codes in group algebras
- Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions
- On the hull-variation problem of equivalent vector rank-metric codes
- Highway to Hull: an algorithm for solving the general matrix code equivalence problem
- On the hull and complementarity of 1-generator quasi-cyclic codes and four-circulant codes
- Galois hulls of constacyclic codes over affine algebra rings
- Hollow LWE: a new spin. Unbounded updatable encryption from LWE and PCE
- On additive codes with one-rank hulls
- Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
This page was built for publication: Finding the permutation between equivalent linear codes: the support splitting algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501759)
