On the Security of Some Cryptosystems Based on Error-Correcting Codes (1994) [21 citations — 2 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Florent Chabaud},
title = {On the Security of Some Cryptosystems Based on Error-Correcting Codes},
year = {1994}
}
Bookmarks
OpenURL
Abstract:
. A certain number of public-key cryptosystems based on errorcorrecting codes have been proposed as an alternative to algorithms based on number theory. In this paper, we analyze algorithms that can be used to attack such cryptosystems in a very precise way, and optimize them. Thus, we obtain some more efficient attacks than those previously known. Even if they remain unfeasible, they indicate the cryptosystems parameters forbidden by the existence of these algorithms. 1 Introduction 1.1 An NP-complete problem It is known [BMT78] that the problem of finding a codeword of given weight in a linear binary code is NP-complete. This property can be used to build cryptosystems or identification systems. But, as for other NP-complete problems, some cases of this problem can be solved by probabilistic algorithms. This means that cryptographic systems such as the following ones must take into account the performances of these algorithms. 1.2 The McEliece public key cryptosystem Presentation T...
Citations
| 1322 | The Theory of Error-Correcting Codes – MacWilliams, Sloane - 1977 |
| 111 | On the inherent intractability of certain coding problems (Corresp – Berlekamp, McEliece, et al. - 1978 |
| 100 | A Public-Key Cryptosystem Based on Algebraic Coding Theory – McEliece |
| 38 | A new identification scheme based on syndrome decoding – Stern - 1994 |
| 25 | An observation on the security of McEliece's public-key cryptosystem – Lee, Brickell - 1989 |
| 25 | A probabilistic algorithm for computing minimum weights of large error-correcting codes – Leon |
| 18 | A method for finding codewords of small weight – Stern - 1989 |
| 17 | Security-related comments regarding McEliece's public-key cryptosystem – Adams, Meijer - 1988 |
| 14 | On cryptosystems based on generalized ReedSolomon codes – Sidelnikov, Shestakov - 1992 |
| 8 | Goppa Codes – Berlekamp - 1973 |
| 7 | Asymptotic analysis of probabilistic algorithms for finding short codewords – Chabaud - 1993 |
