A Statistical Decoding Algorithm for General Linear Block Codes

Authors:
A. Kh. Al Jabri
Affiliations:
-
Venue:
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Year:
2001

Citing 3
Cited 3

An observation on the security of McEliece's public-key cryptosystem

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A method for finding codewords of small weight

Proceedings of the third international colloquium on Coding theory and applications
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory

Smaller decoding exponents: ball-collision decoding

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Statistical decoding revisited

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Statistical decoding of codes over Fq

PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new decoding algorithm for general linear block codes. The algorithm generates a direct estimate of the error locations based on exploiting the statistical information embedded in the classical syndrome decoding. The algorithm can be used to cryptanalyze many algebraic-code public-key crypto and identification systems. In particular results show that the McEliece public-key cryptosystem with its original parameters is not secure.