Statistical decoding revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4058 LNCS, Issue , 2006, Pages 283-294

  Overbeck, R ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Code based cryptography; Coding theory; General decoding; McEliece Cryptosystem; Public key cryptography

Indexed keywords

ALGORITHMS; ERROR CORRECTION; NUMERICAL ANALYSIS; PROBABILITY; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES;

CODE BASED CRYPTOGRAPHY; CODING THEORY; GENERAL DECODING; MCELIECE CRYPTOSYSTEM;

DECODING;

EID: 33746393306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780656_24     Document Type: Conference Paper

References (7)

1. E. Berlekamp, R. McEliece, and H. van Tilborg. On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory, 24(3):384-386, 1978.
2. A. Canteaut and F. Chabaud. 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. IEEETIT: IEEE Transactions on Information Theory, 44, 1998.
3. N. Courtois, M. Finiasz, and N.Sendrier. How to achieve a McEliece-based digital signature scheme. In Advances in Cryptology - ASIACRYPT 2001, volume 2248, pages 157-174. Springer-Verlag, 2001.
4. A. Al Jabri. A statistical decoding algorithm for general linear block codes. In Cryptography and Coding 2001, volume 2260 of LNCS, pages 1-8. Springer Verlag, 2001.
5. R.J. McEliece. A public key cryptosystem based on algebraic coding theory. DSN progress report, 42-44:114-116, 1978.
6. N. Sendrier. On the security of the McEliece public-key cryptosystem. In M. Blaum, P.G. Farrell, and H. van Tilborg, editors, Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday, pages 141-163. Kluwer, 2002.
7. J. Stern. A method for finding codewords of small weight. Coding Theory and Applications, 388:106-133, 1989.