Is code equivalence easy to decide?
From MaRDI portal
Publication:4371902
Recommendations
- About the code equivalence
- The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
- A solution of an equivalence problem for semisimple cyclic codes
- ABOUT CODE EQUIVALENCE — A GEOMETRIC APPROACH
- A NP-complete problem in coding theory with application to code based cryptography
Cited in
(42)- Quantum algorithms for algebraic problems
- Computing normalisers of intransitive groups
- Hardness estimates of the code equivalence problem in the rank metric
- MDS codes with \(l\)-Galois hulls of arbitrary dimensions
- Monomial isomorphism for tensors and applications to code equivalence problems
- On two modifications of the McEliece PKE and the CFS signature scheme
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property
- Tensor Codes and Their Invariants
- Graph theoretic aspects of minimum distance and equivalence of binary linear codes
- The hardness of code equivalence over \(\mathbb F_q\) and its application to code-based cryptography
- A new formulation of the linear equivalence problem and shorter less signatures
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- Non-interactive commitment from non-transitive group actions
- On a Gröbner bases structure associated to linear codes
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- A solution of an equivalence problem for semisimple cyclic codes
- A new algorithm for equivalence of cyclic codes and its applications
- About the code equivalence
- Hulls of cyclic and negacyclic codes over finite fields
- On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\)
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- A NP-complete problem in coding theory with application to code based cryptography
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- General linear group action on tensors: a candidate for post-quantum cryptography
- Hulls of cyclic serial codes over a finite chain ring
- Zero-knowledge interactive proof systems for new lattice problems
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- scientific article; zbMATH DE number 7622441 (Why is no real title available?)
- Lossy cryptography from code-based assumptions
- New binary and ternary quasi-cyclic codes with good properties
- Semantic security for the McEliece cryptosystem without random oracles
- Computing an invariant of a linear code
- Hermitian hulls of constacyclic codes and their applications to quantum codes
- On the computational hardness of the code equivalence problem in cryptography
- Algorithms for group isomorphism via group extensions and cohomology
- Galois hulls of constacyclic codes over finite fields
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- Minimum circuit size, graph isomorphism, and related problems
- Minimum circuit size, graph isomorphism, and related problems
- On isomorphism testing of groups with normal Hall subgroups
- LESS is more: code-based signatures without syndromes
This page was built for publication: Is code equivalence easy to decide?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371902)
