The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
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
Abstract
An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some weaknesses in McEliece's (1978) cipher. We also determine with it the minimum distance of some BCH codes of length 511.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Kemeny, J. G., & Snell, J. L. (1976) · Medical Entomology and Zoology · Cited by 2,813
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
Bush, K. A., Kemeny, J. G., & Snell, J. L. (1960) · The American Mathematical Monthly · doi:10.2307/2309264 · Cited by 1,546
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Knapsack-type cryptosystems and algebraic coding theory
Niederreiter, H. (1986) · Medical Entomology and Zoology · Cited by 587
A method for finding codewords of small weight
Stern, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0019850 · Cited by 464
A new identification scheme based on syndrome decoding
Stern, J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_2 · Cited by 353
An Observation on the Security of McEliece’s Public-Key Cryptosystem
Lee, P. J., & Brickell, E. F. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-45961-8_25 · Cited by 290
On insecurity of cryptosystems based on generalized Reed-Solomon codes
SIDELNIKOV, V. M., & SHESTAKOV, S. O. (1992) · Discrete Mathematics and Applications · doi:10.1515/dma.1992.2.4.439 · Cited by 235
Cited by
How to Achieve a McEliece-Based Digital Signature Scheme
Courtois, N. T., Finiasz, M., & Sendrier, N. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_10 · Cited by 435
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
Misoczki, R., Tillich, J.-P., Sendrier, N., & Barreto, P. S. L. M. (2013) · 2013 IEEE International Symposium on Information Theory · doi:10.1109/isit.2013.6620590 · Cited by 420
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Becker, A., Joux, A., May, A., & Meurer, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_31 · Cited by 398
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413 · Cited by 395
Attacking and Defending the McEliece Cryptosystem
Bernstein, D. J., Lange, T., & Peters, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88403-3_3 · Cited by 341
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Security Bounds for the Design of Code-Based Cryptosystems
Finiasz, M., & Sendrier, N. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_6 · Cited by 260
Differential collisions in SHA-0
Chabaud, F., & Joux, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055720 · Cited by 209
Self-citationSmaller Decoding Exponents: Ball-Collision Decoding
Bernstein, D. J., Lange, T., & Peters, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_42 · Cited by 191
Efficient Encryption From Random Quasi-Cyclic Codes
Aguilar-Melchor, C., Blazy, O., Deneuville, J.-C., Gaborit, P., & Zemor, G. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2804444 · Cited by 122
A distinguisher for high rate McEliece cryptosystems
Faugere, J.-C., Gauthier-Umana, V., Otmani, A., Perret, L., & Tillich, J.-P. (2011) · 2011 IEEE Information Theory Workshop · doi:10.1109/itw.2011.6089437 · Cited by 108
“The problem of decoding an unstructured code is a long-standing problem whose most effective algorithms [19, 20, 31, 10, 5] have an exponential time complexity.”
BackgroundAnalysis of Information Set Decoding for a Sub-linear Error Weight
Canto Torres, R., & Sendrier, N. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_10 · Cited by 85
Structural cryptanalysis of McEliece schemes with compact keys
Faugère, J.-C., Otmani, A., Perret, L., de Portzamparc, F., & Tillich, J.-P. (2016) · Designs, Codes and Cryptography · doi:10.1007/s10623-015-0036-z · Cited by 49
On the dimension and structure of the square of the dual of a Goppa code
Mora, R., & Tillich, J.-P. (2023) · Designs, Codes and Cryptography · doi:10.1007/s10623-022-01153-w · Cited by 18
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes
Bardet, M., Mora, R., & Tillich, J.-P. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3334592 · Cited by 15
“Despite considerable improvements [6], [7], [8], [9], [10], [11], all these algorithms have exponential complexity.”
BackgroundOn the matrix code of quadratic relationships for a Goppa code
Mora, R. (2025) · Advances in Mathematics of Communications · doi:10.3934/amc.2024026 · Cited by 3
Metadata
- Authors
- Canteaut, A., & Chabaud, F.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 1
- Pages
- 367-378
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2099250555
- Cited by
- 350
- References
- 18
- FWCI
- 5.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.