Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Augot, D., Finiasz, M., Sendrier, N.: A Family of Fast Syndrome Based Cryptographic Hash Functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 64–83. Springer, Heidelberg (2005); Cited on page 7
Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing Key Length of the McEliece Cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77–97. Springer, Heidelberg (2009); Cited on page 6
Bernstein, D.J., Lange, T., Peters, C.: Ball-collision decoding. Cryptology ePrint Archive, Report 2010/585 (2010), http://eprint.iacr.org/2010/585.pdf ; Cited on page 1
Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Faster 2-regular information-set decoding. Cryptology ePrint Archive, Report 2011/120 (2011), http://eprint.iacr.org/ ; Cited on page 7
Cayrel, P.-L., Véron, P., El Yousfi Alaoui, S.M.: Improved code-based identification scheme. In: SAC 2010 (2010), http://arxiv.org/abs/1001.3017v1 ; Cited on page 6
Cheung, K.-M.: The weight distribution and randomness of linear codes. TDA Progress Report 42–97, Communications Systems Research Section (1989); Cited on page 7
Al Jabri, A.: A Statistical Decoding Algorithm for General Linear Block Codes. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 1–8. Springer, Heidelberg (2001); Cited on page 1
MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Mathematical Library, vol. 16 (1977); Cited on page 7
McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DNS Progress Report, pp. 114–116 (1978); Cited on page 1
Minder, L., Sinclair, A.: The extended k-tree algorithm. In: SODA, pp. 586–595 (2009); Cited on page 1
Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for Information Set Decoding over \(\mathbb{F}_{q}\). In: SCC 2010, RHUL, London, UK, pp. 143–158 (2010); Cited on page 1 and 9
Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for Information Set Decoding over \(\mathbb{F}_{q}\). and on the effect of Partial Knowledge. Submitted to Math in CS, SCC 2010 (2011); Cited on page 9
Overbeck, R.: Statistical Decoding Revisited. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol. 4058, pp. 283–294. Springer, Heidelberg (2006); Cited on page 1, 7 and 10
Peters, C.: Information-set decoding for linear codes over \(\mathbb{F}_{q}\). In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 81–94. Springer, Heidelberg (2010); Cited on page 9
Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory, 5–9 (1962); Cited on page 9
Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring, pp. 124–134. IEEE Press (1994); Cited on page 1
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-25405-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-25405-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25404-8
Online ISBN: 978-3-642-25405-5
eBook Packages: Computer ScienceComputer Science (R0)