Is code equivalence easy to decide?

No abstract is available for this paper.

• Publication year

  1997

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1997-09-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/18.623157
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Applied Cryptography

  2018cited by this paper
• On insecurity of cryptosystems based on generalized Reed-Solomon codes

  1992cited by this paper
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

  1991cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes

  1988cited by this paper
• Does co-NP Have Short Interactive Proofs?

  1987cited by this paper
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

  1986cited by this paper
• Private coins versus public coins in interactive proof systems

  1986cited by this paper
• On generator matrices of MDS codes

  1985cited by this paper
• A public key cryptosystem based on algebraic coding theory

  1978cited by this paper
• The theory of error-correcting codes (north-holland

  1977cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper
• New generalizations of the Reed-Muller codes-I: Primitive codes

  1968cited by this paper
• New generalizations of the Reed-Muller codes-II: Nonprimitive codes

  1968cited by this paper

• Asymptotic Improvements to Provable Algorithms for the Code Equivalence Problem

  2026cites this paper
• Invariants for sum-rank metric codes

  2025cites this paper
• On the construction of Barnes-Wall lattices and their application in cryptography

  2025cites this paper
• Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems

  2025cites this paper
• Hulls of separable double cyclic codes over Zp2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {Z}}_{p^2}$$\e

  2025cites this paper
• Lossy Cryptography from Code-Based Assumptions Dense-Sparse LPN: A New Subexponentially Hard LPN Variant in SZK

  2025cites this paper
• Weak Instances of the Inverse Matrix Code Equivalence Problem

  2025cites this paper
• Analyzing the Potential of Polar Codes in Modern Cryptography: A Survey

  2025cites this paper
• On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness

  2025cites this paper
• The Code Equivalence Problem and Its Applications to Cryptography

  2025cites this paper
• Code Equivalence, Point Set Equivalence, and Polynomial Isomorphism

  2025cites this paper
• Vanishing of Schubert coefficients is in AM ∩ coAM assuming the GRH

  2025cites this paper
• Fast Successive Cancellation Decoding of Polar Codes With Large Kernels

  2025cites this paper
• Reductions Between Code Equivalence Problems

  2025cites this paper
• Average dimensions of Galois hulls of constacyclic codes

  2025cites this paper
• Don't Use it Twice! Solving Relaxed Linear Equivalence Problems

  2024cites this paper
• Binary LCD Codes and Their Graph Representations

  2024cites this paper
• SoK: CryptographicEstimators -- a Software Library for Cryptographic Hardness Estimation

  2024cites this paper
• Relating code equivalence to other isomorphism problems

  2024influential citation
• Post-Quantum Cryptosystems: Open Problems and Current Solutions. Isogeny-Based and Code-Based Cryptosystems

  2024cites this paper
• MDS codes with l-Galois hulls of arbitrary dimensions

  2024cites this paper
• Don't Use It Twice! Solving Relaxed Linear Code Equivalence Problems

  2024cites this paper
• How to Find the Equivalence Classes in a Set of Linear Codes in Practice?

  2024cites this paper
• On the hulls of cyclic codes of oddly even length over Z4

  2024cites this paper
• Monomial isomorphism for tensors and applications to code equivalence problems

  2024cites this paper
• Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems

  2024cites this paper
• Fast Search Method for Large Polarization Kernels

  2023cites this paper
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness

  2023cites this paper
• On p-Group Isomorphism: Search-to-Decision, Counting-to-Decision, and Nilpotency Class Reductions via Tensors

  2023cites this paper
• A Search-to-Decision Reduction for the Permutation Code Equivalence Problem

  2023cites this paper
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials IV: Linear-Length Reductions and Their Applications

  2023cites this paper
• A New Formulation of the Linear Equivalence Problem and Shorter LESS Signatures

  2023cites this paper
• Non-Interactive Commitment from Non-Transitive Group Actions

  2023cites this paper
• On the algebraic proof complexity of Tensor Isomorphism

  2023cites this paper
• Post-Quantum Cryptography

  2022cites this paper
• On Arbitrary Dimension Hull Linear Codes from Self-Orthogonal Codes and Some New EAQECCs

  2022cites this paper
• On Arbitrary Dimension Hermitian Hull linear codes from Hermitian self-orthogonal codes and New Hermitian Self-Orthogonal GRS Codes

  2022cites this paper
• On Constructions of New MDS Codes with Arbitrary-Dimensional Galois Hulls

  2022cites this paper
• Galois hulls of constacyclic codes over finite fields

  2022cites this paper
• 2022 Galois hulls of linear codes and new EAQECCs with arbitrary lengths

  2022influential citation
• Several Classes of New MDS Codes with Arbitrary-Dimensional Hulls and Their Applications

  2022cites this paper
• Hermitian Hulls of Constacyclic Codes and Their Applications to Quantum Codes

  2022cites this paper
• A graphical representation of binary linear codes

  2022cites this paper
• Hulls of cyclic serial codes over a finite chain ring

  2022cites this paper
• A Note on the Hardness of Problems from Cryptographic Group Actions

  2022cites this paper
• About Code Equivalence - a Geometric Approach

  2022cites this paper
• Probabilistic Hash-and-Sign with Retry in the Quantum Random Oracle Model

  2022influential citation
• Code Equivalence in the Sum-Rank Metric: Hardness and Completeness

  2022cites this paper
• On the Computational Hardness of the Code Equivalence Problem in Cryptography

  2022cites this paper
• On arbitrary dimension Galois hull MDS codes

  2022cites this paper
• Graph theoretic aspects of minimum distance and equivalence of binary linear codes

  2021cites this paper
• A Search Method for Large Polarization Kernels

  2021cites this paper
• Code-Based Non-Interactive Key Exchange Can Be Made

  2021cites this paper
• Tensor Codes and their Invariants

  2021cites this paper
• Computing normalisers of intransitive groups

  2021cites this paper
• A polynomial-time reduction from the multi-graph isomorphism problem to additive code equivalence

  2021influential citation
• A generalization of cyclic code equivalence algorithm to constacyclic codes

  2021cites this paper
• New binary and ternary quasi-cyclic codes with good properties

  2021cites this paper
• On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors

  2021cites this paper
• LESS-FM: Fine-Tuning Signatures from the Code Equivalence Problem

  2021cites this paper
• A new algorithm for equivalence of cyclic codes and its applications

  2021cites this paper
• Testing isomorphism between tuples of subspaces

  2021cites this paper
• LESS-FM: Fine-tuning Signatures from a Code-based Cryptographic Group Action

  2021cites this paper
• Galois hulls of cyclic serial codes over a finite chain ring

  2021cites this paper
• LESS is More: Code-Based Signatures Without Syndromes

  2020cites this paper
• Mathematical Aspects of Computer and Information Sciences: 8th International Conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019, Revised Selected Papers

  2020cites this paper
• Rank and Kernel of Fp-Additive Generalised Hadamard Codes

  2020cites this paper
• On the hardness of code equivalence problems in rank metric

  2020cites this paper
• Computing an Invariant of a Linear Code

  2019cites this paper
• MDS Codes With Hulls of Arbitrary Dimensions and Their Quantum Error Correction

  2019cites this paper
• On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes

  2019cites this paper
• Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial

  2019cites this paper
• Invariants and Inequivalence of Linear Rank-Metric Codes

  2019cites this paper
• General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography

  2019cites this paper
• Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions

  2019influential citation
• Determining whether a given cryptographic function is a permutation of another given cryptographic function - A problem in intellectual property

  2019cites this paper
• polarRLCE: A New Code-Based Cryptosystem Using Polar Codes

  2019cites this paper
• A Quantum Resistant Chameleon Hashing and Signature Scheme

  2019cites this paper
• Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs

  2018cites this paper
• MDS codes with arbitrary dimensional hull and their applications

  2018cites this paper
• Survey on cryptanalysis of code-based cryptography: From theoretical to physical attacks

  2018cites this paper
• McEliece-type Cryptosystems over Quasi-cyclic Codes

  2018cites this paper
• C C ] 2 6 O ct 2 01 7 Minimum Circuit Size , Graph Isomorphism , and Related Problems ∗

  2018cites this paper
• Algebraic Approach for Code Equivalence

  2017influential citation
• Algebraic approach for the study of algorithmic problems coming from cryptography and the theory of error correcting codes. (Approche algébrique pour l'étude et la résolution de problèmes algorithmiques issus de la cryptographie et de la théorie des codes )

  2017cites this paper
• An algebraic approach for the resolution of algorithmic problems raised by cryptography and coding theory

  2017cites this paper
• Evolution of the McEliece Public Key Encryption Scheme

  2017cites this paper
• A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography

  2017cites this paper
• Etude de cryptosystèmes à clé publique basés sur les codes MDPC quasi-cycliques. (Study of public key cryptosystems based on quasi-cyclic MDPC codes)

  2017cites this paper
• Minimum Circuit Size, Graph Isomorphism, and Related Problems

  2017cites this paper
• Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding

  2016cites this paper
• Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes

  2016cites this paper
• Limitations of single coset states and quantum algorithms for code equivalence

  2015cites this paper
• Post-Quantum Cryptography

  2015cites this paper
• Representing Equivalence Problems for Combinatorial Objects

  2015cites this paper
• Zero-Knowledge Interactive Proof Systems for New Lattice Problems

  2015cites this paper
• Cryptography from Post-Quantum Assumptions

  2015influential citation
• Hulls of cyclic and negacyclic codes over finite fields

  2015cites this paper
• Towards Understanding Satisfiability, Group Isomorphism and Their Connections

  2013cites this paper
• How easy is code equivalence over F_q

  2013cites this paper