Is code equivalence easy to decide?
From MaRDI portal
Publication:4371902
DOI10.1109/18.623157zbMATH Open0884.94025OpenAlexW2156052684MaRDI QIDQ4371902FDOQ4371902
Authors: Erez Petrank, Ron M. Roth 
Publication date: 13 April 1998
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5c1624d163a4fb426f8dbf4929628031a1575c08
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
Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Linear codes (general theory) (94B05)
Cited In (42)
- Computing normalisers of intransitive groups
- 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
- Non-interactive commitment from non-transitive group actions
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
- 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 new algorithm for equivalence of cyclic codes and its applications
- A solution of an equivalence problem for semisimple cyclic codes
- About the code equivalence
- On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\)
- Hulls of cyclic and negacyclic codes over finite fields
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- A generalization of cyclic code equivalence algorithm to constacyclic codes
- 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
- Hulls of cyclic serial codes over a finite chain ring
- General linear group action on tensors: a candidate for post-quantum cryptography
- Zero-knowledge interactive proof systems for new lattice problems
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- Title not available (Why is that?)
- Lossy cryptography from code-based assumptions
- New binary and ternary quasi-cyclic codes with good properties
- Computing an invariant of a linear code
- On the computational hardness of the code equivalence problem in cryptography
- Algorithms for group isomorphism via group extensions and cohomology
- Semantic security for the McEliece cryptosystem without random oracles
- Hermitian hulls of constacyclic codes and their applications to quantum codes
- 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
- LESS is more: code-based signatures without syndromes
- On isomorphism testing of groups with normal Hall subgroups
- Hardness estimates of the code equivalence problem in the rank metric
- Quantum algorithms for algebraic problems
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)
