The Hardness of Code Equivalence over $\mathbf{F}_q$ and its Application to Code-based Cryptography
Uložené v:
| Názov: | The Hardness of Code Equivalence over $\mathbf{F}_q$ and its Application to Code-based Cryptography |
|---|---|
| Autori: | Sendrier, Nicolas, Simos, Dimitrios E. |
| Prispievatelia: | Security, Cryptology and Transmissions (SECRET), Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), sba-research, Philippe Gaborit |
| Zdroj: | Post-Quantum Cryptography - PQCrypto 2013 ; https://hal.inria.fr/hal-00863598 ; Post-Quantum Cryptography - PQCrypto 2013, Jun 2013, Limoges, France. pp.203-216, ⟨10.1007/978-3-642-38616-9⟩ |
| Informácie o vydavateľovi: | HAL CCSD Springer |
| Rok vydania: | 2013 |
| Zbierka: | Archive ouverte HAL (Hyper Article en Ligne, CCSD - Centre pour la Communication Scientifique Directe) |
| Predmety: | code-based cryptosystems, quasi-dyadic codes, efficient algorithms, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR] |
| Geografické téma: | Limoges, France |
| Popis: | International audience ; The code equivalence problem is to decide whether two linear codes over F_q are equivalent, that is identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over F_q due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Girault and discuss on a connection between code equivalence and the hidden subgroup problem. |
| Druh dokumentu: | conference object |
| Jazyk: | English |
| Relation: | hal-00863598; https://hal.inria.fr/hal-00863598; https://hal.inria.fr/hal-00863598/document; https://hal.inria.fr/hal-00863598/file/codeqapp2.pdf |
| DOI: | 10.1007/978-3-642-38616-9 |
| Dostupnosť: | https://hal.inria.fr/hal-00863598 https://hal.inria.fr/hal-00863598/document https://hal.inria.fr/hal-00863598/file/codeqapp2.pdf https://doi.org/10.1007/978-3-642-38616-9 |
| Rights: | info:eu-repo/semantics/OpenAccess |
| Prístupové číslo: | edsbas.A076CEB2 |
| Databáza: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | International audience ; The code equivalence problem is to decide whether two linear codes over F_q are equivalent, that is identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over F_q due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Girault and discuss on a connection between code equivalence and the hidden subgroup problem. |
|---|---|
| DOI: | 10.1007/978-3-642-38616-9 |