Improvement of Generic Attacks on the Rank Syndrome Decoding Problem - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Improvement of Generic Attacks on the Rank Syndrome Decoding Problem

(1) , (1) , (2, 1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
newGRS.pdf (414.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01618464 , version 1 (18-10-2017)

Identifiers

  • HAL Id : hal-01618464 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More