Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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 metadata
Contributor : Philippe Gaborit Connect in order to contact the contributor
Submitted on : Wednesday, October 18, 2017 - 2:44:38 AM
Last modification on : Tuesday, January 11, 2022 - 11:16:05 AM
Long-term archiving on: : Friday, January 19, 2018 - 12:37:59 PM


Files produced by the author(s)


  • HAL Id : hal-01618464, version 1



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



Les métriques sont temporairement indisponibles