The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography

DOI10.1007/978-3-642-38616-9_14zbMath1306.94110OpenAlexW2107670183MaRDI QIDQ4928598

Dimitris E. Simos, Nicolas Sendrier

Publication date: 14 June 2013

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38616-9_14

zbMATH Keywords

isometrylinear codeshardnesszero-knowledge protocolscode equivalencequantum Fourier sampling

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Not enough less: an improved algorithm for solving code equivalence problems over \(\mathbb{F}_q\) ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ Computing normalisers of intransitive groups ⋮ On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings ⋮ Zero-Knowledge Interactive Proof Systems for New Lattice Problems ⋮ Isometries of the Hamming Space and Equivalence Relations of Linear Codes Over a Finite Field ⋮ General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Theory of additive complementary dual codes, constructions and computations ⋮ Tensor Codes and Their Invariants ⋮ Hull attacks on the lattice isomorphism problem ⋮ A new algorithm for equivalence of cyclic codes and its applications ⋮ A Method of Protected Distribution of Data Among Unreliable and Untrusted Nodes ⋮ Binary optimal linear codes with various hull dimensions and entanglement-assisted QECCs ⋮ A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography ⋮ 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 ⋮ Computing an Invariant of a Linear Code

This page was built for publication: The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography