Statistical decoding revisited

Authors:
R. Overbeck
Affiliations:
Department of Computer Science, Cryptography and Computer Algebra Group, GK Electronic Commerce, TU-Darmstadt
Venue:
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Year:
2006

Citing 4
Cited 2

A method for finding codewords of small weight

Proceedings of the 3rd International Colloquium on Coding Theory and Applications
How to Achieve a McEliece-Based Digital Signature Scheme

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Statistical Decoding Algorithm for General Linear Block Codes

Proceedings of the 8th IMA International Conference on Cryptography and Coding
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 of codes over Fq

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we look at the statistical decoding attack on the McEliece cryptosystem from [4]. The statistical decoding algorithm is a probabilistic algorithm for correcting errors in random codes. It uses precomptuations to provide faster error correction than the classical general decoding algorithms. We analyze the success probability of the algorithm and show how to improve it. Further, we show that the algorithm may not be used to attack the McEliece cryptosystem, due to the large amount of precomputation needed.