The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Reducing Key Length of 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
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947 · cited 2×
“high-speed encryption and decryption compared with other public-key cryptosystems which involve for instance modular exponentiations (even faster than the NTRU cryptosystem [15]), 2.”
BackgroundBernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
A method for finding codewords of small weight
Stern, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0019850 · Cited by 464
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
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
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
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
Self-citationA 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
“For compact variants [18], [19] of [2], additional structures permit to drastically reduce the number of variables allowing to solve (2) for a large set of parameters in polynomial-time using dedicated Gröbner bases techniques [14].”
Self-citationStructural 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
Self-citation
Metadata
- Authors
- Berger, T. P., Cayrel, P.-L., Gaborit, P., & Otmani, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 77-97
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1520077026
- Cited by
- 205
- References
- 4
- FWCI
- 12.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reducing Key Length of the McEliece Cryptosystem. https://app.cochat.ai/papers/10.1007/978-3-642-02384-2_6
- The paper
- Berger, T. P., Cayrel, P.-L., Gaborit, P., & Otmani, A. (2009). Reducing Key Length of the McEliece Cryptosystem. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-02384-2_6
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.