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

Statistical Decoding

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Thomas Debris-Alazard Connect in order to contact the contributor
Submitted on : Tuesday, December 12, 2017 - 10:58:16 AM
Last modification on : Wednesday, June 8, 2022 - 12:50:05 PM


Files produced by the author(s)


  • HAL Id : hal-01661745, version 1



Thomas Debris-Alazard, Jean-Pierre Tillich. Statistical Decoding. 2017. ⟨hal-01661745⟩



Record views


Files downloads