Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Maxime Bombar"'
Autor:
Maxime Bombar, Alain Couvreur
Publikováno v:
WCC 2022 : The Twelfth International Workshop on Coding and Cryptography
WCC 2022 : The Twelfth International Workshop on Coding and Cryptography, Mar 2022, Rostock, Germany
HAL
WCC 2022 : The Twelfth International Workshop on Coding and Cryptography, Mar 2022, Rostock, Germany
HAL
We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We give the full presentation of a decoding algorithm for Gabidulin codes, which as Loidreau's seminal algorithm consists in localizing errors in the spirit of Berlekamp-Welch algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::624a2347ed777ad6217002495e6f5043
https://hal.science/hal-03481406
https://hal.science/hal-03481406
Publikováno v:
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159787
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ead5fc2ca1e04c7603e6c7ed08f9eef7
https://doi.org/10.1007/978-3-031-15979-4_18
https://doi.org/10.1007/978-3-031-15979-4_18
Autor:
Alain Couvreur, Maxime Bombar
Publikováno v:
Post-Quantum Cryptography 2021
Post-Quantum Cryptography 2021, Jul 2021, Daejeon, South Korea. pp.3-22, ⟨10.1007/978-3-030-81293-5_1⟩
Post-Quantum Cryptography ISBN: 9783030812928
PQCrypto
Post-Quantum Cryptography 2021, Jul 2021, Daejeon, South Korea. pp.3-22, ⟨10.1007/978-3-030-81293-5_1⟩
Post-Quantum Cryptography ISBN: 9783030812928
PQCrypto
This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the decoding radius. Using this decoder, we provide polynomial time attacks
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4d2ef4dc9226a2b9b78f0db39dee6cd
http://arxiv.org/abs/2103.02700
http://arxiv.org/abs/2103.02700
Publikováno v:
HAL
Lecture Notes in Computer Science
CRYPTO 2022
CRYPTO 2022, Aug 2022, Santa Barbara (CA), United States. pp.513-540, ⟨10.1007/978-3-031-15979-4_18⟩
Lecture Notes in Computer Science
CRYPTO 2022
CRYPTO 2022, Aug 2022, Santa Barbara (CA), United States. pp.513-540, ⟨10.1007/978-3-031-15979-4_18⟩
International audience; It is a long standing open problem to find search to decision reductions for structured versions of the decoding problem of linear codes. Such results in the lattice-based setting have been carried out using number fields: Pol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::19be3e551bc2aec1969b40d3bde22ae1
https://hal.archives-ouvertes.fr/hal-03597834
https://hal.archives-ouvertes.fr/hal-03597834