Improvement of Generic Attacks on the Rank Syndrome Decoding Problem

Abstract : Rank metric code-based cryptography exists for several years. The security of many cryptosystems is based on the difficulty of decoding a random code. Any improvement in the complexity of the best decoding algorithms can have a big impact on the security of these schemes. In this article, we present an improvement on the recent GRS algorithm [1] and we obtain a complexity of O ((n − k)^ 3 m^3 q^( w (k+1)m/ n −m ))for decoding an error of weight w in an [n, k] F 2 m-linear code.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01618464
Contributor : Philippe Gaborit <>
Submitted on : Wednesday, October 18, 2017 - 2:44:38 AM
Last modification on : Thursday, April 26, 2018 - 10:28:43 AM
Long-term archiving on : Friday, January 19, 2018 - 12:37:59 PM

File

newGRS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01618464, version 1

Collections

Citation

Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, Jean-Pierre Tillich. Improvement of Generic Attacks on the Rank Syndrome Decoding Problem. 2017. ⟨hal-01618464⟩

Share

Metrics

Record views

515

Files downloads

339