A Statistical Decoding Algorithm for General Linear Block Codes
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
A family of fast syndrome based cryptographic hash functions
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
Information-set decoding for linear codes over Fq
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Statistical decoding revisited
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
| Hi-index | 0.00 |
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.