International Workshop on Post-Quantum Cryptography

PQCrypto 2011: Post-Quantum Cryptography pp 217-227

Statistical Decoding of Codes over \(\mathbb{F}_q\)

  • Robert Niebuhr
Conference paper

DOI: 10.1007/978-3-642-25405-5_14

Volume 7071 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Niebuhr R. (2011) Statistical Decoding of Codes over $\mathbb{F}_q$. In: Yang BY. (eds) Post-Quantum Cryptography. PQCrypto 2011. Lecture Notes in Computer Science, vol 7071. Springer, Berlin, Heidelberg


In this paper we analyze statistical decoding over a finite field \(\mathbb{F}_q\). We generalize Overbeck’s binary statistical decoding algorithm to codes over \(\mathbb{F}_q\), and analyze the success probability of our algorithm. We provide experimental data for different field sizes. In addition to that, we describe two techniques how knowledge about structure of the code or of the solution can be used in order to speed up the decoding algorithm.


Statistical decoding general decoding code-based cryptography public-key cryptography 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Robert Niebuhr
    • 1
  1. 1.Fachbereich Informatik Kryptographie und ComputeralgebraTechnische Universität DarmstadtDarmstadtGermany