The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Attacking and Defending the McEliece Cryptosystem
Open accessOverview
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
A Public-Key Cryptosystem Based On Algebraic Coding Theory
McEliece, R. J. (1978) · Deep Space Network Progress Report · Cited by 1,578
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
Canteaut, A., & Chabaud, F. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651067 · Cited by 350
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
The algebraic decoding of Goppa codes
Patterson, N. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055350 · Cited by 231
A probabilistic algorithm for computing minimum weights of large error-correcting codes
Leon, J. S. (1988) · IEEE Transactions on Information Theory · doi:10.1109/18.21270 · Cited by 224
Overbeck, R., & Sendrier, N. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_4 · Cited by 197
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
Li, Y. X., Deng, R. H., & Wang, X. M. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.272496 · Cited by 162
A Summary of McEliece-Type Cryptosystems and their Security
Engelbert, D., Overbeck, R., & Schmidt, A. (2007) · Journal of Mathematical Cryptology · doi:10.1515/jmc.2007.009 · Cited by 86
Cryptanalysis of the Original McEliece Cryptosystem
Canteaut, A., & Sendrier, N. (2000) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_16 · Cited by 83
List Decoding for Binary Goppa Codes
Bernstein, D. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20901-7_4 · Cited by 59
Self-citationOn the McEliece Public-Key Cryptosystem
van Tilburg, J. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_10 · Cited by 48
On the Security of the McEliece Public-Key Cryptosystem
Sendrier, N. (2002) · Springer eBooks · doi:10.1007/978-1-4757-3585-7_10 · Cited by 37
The minimum number of edges in graphs with prescribed paths
Pippenger, N. J. (1978) · Theory of Computing Systems · doi:10.1007/bf01776581 · Cited by 29
A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem
Canteaut, A., & Chabanne, H. (1994) · INRIA a CCSD electronic archive server · Cited by 22
Information, Coding and Mathematics
(2002) · Springer eBooks · doi:10.1007/978-1-4757-3585-7 · Cited by 22
Accelerating Cryptanalysis with the Method of Four Russians.
Bard, G. V. (2006) · Cited by 19
Cited by
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
“McEliece’s original key sizes were designed for 264 security, and our successful attack against those key sizes thirty years later [25] took more than 260 CPU cycles.”
Self-citationFernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
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
“Notice that three out of the four parameter sets for security levels between 80 and 256 bit from [3] closely match these code parameters.”
BackgroundStatus 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
Metadata
- Authors
- Bernstein, D. J., Lange, T., & Peters, C.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Pages
- 31-46
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2149636648
- Cited by
- 341
- References
- 19
- FWCI
- 17.12
- Type
- conference paper
- Language
- en
- Open access
- green
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.