Statistical Decoding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Statistical Decoding


The security of code-based cryptography relies primarily on the hardness of generic decoding with linear codes. The best generic decoding algorithms are all improvements of an old algorithm due to Prange: they are known under the name of information set decoding techniques (ISD). A while ago a generic decoding algorithm which does not belong to this family was proposed: statistical decoding. It is a randomized algorithm that requires the computation of a large set of parity-check equations of moderate weight. We solve here several open problems related to this decoding algorithm. We give in particular the asymptotic complexity of this algorithm, give a rather efficient way of computing the parity-check equations needed for it inspired by ISD techniques and give a lower bound on its complexity showing that when it comes to decoding on the Gilbert-Varshamov bound it can never be better than Prange's algorithm.
Fichier principal
Vignette du fichier
isitStatDecoding.pdf (350.52 Ko) Télécharger le fichier
Origin Explicit agreement for this submission

Dates and versions

hal-01661749 , version 1 (12-12-2017)



Thomas Debris-Alazard, Jean-Pierre Tillich. Statistical Decoding. ISIT 2017 - IEEE International Symposium on Information Theory, Jun 2017, Aachen, Germany. pp.1789--1802, ⟨10.1109/ISIT.2017.8006839⟩. ⟨hal-01661749⟩


87 View
418 Download



Gmail Mastodon Facebook X LinkedIn More