The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
The syzygy Distinguisher
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“During the fourth round, there has been significant progress in cryptanalysis techniques that are applicable to key recovery and the related problem of distinguishing a Goppa code from a random linear code [46, 66-69].”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [46]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“More recent work [46] has proposed a distinguisher that claims to asymptotically break the indistinguishability of Goppa codes with parameters that are similar to those used by Classic McEliece but that target a much higher security level.”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [46]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Nonetheless, algebraic attacks that target the structure of Goppa codes and achieve either key recovery or a distinguisher from a random linear code have remained an active area of research [46, 65-69].”
From Status report on the fourth round of the NIST post-quantum cryptography standardization process (2025) · cites this paper as [46]
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
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
Patarin, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_4 · Cited by 662
The use of information sets in decoding cyclic codes
Prange, E. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057777 · Cited by 463
Lectures on Curves on an Algebraic Surface. (AM-59)
Mumford, D. B. (1966) · Princeton University Press eBooks · doi:10.1515/9781400882069 · Cited by 443
Ideals defined by matrices and a certain complex associated with them
Eagon, J. A., & Northcott, D. G. (1962) · Proceedings of the Royal Society of London A Mathematical and Physical Sciences · doi:10.1098/rspa.1962.0170 · Cited by 314
(2005) · Graduate Texts in Mathematics · doi:10.1007/b137572 · Cited by 200
A Distinguisher for High-Rate McEliece Cryptosystems
Faugère, J., Gauthier–Umaña, V., Otmani, A., Perret, L., & Tillich, J. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2272036 · Cited by 109
On the distribution of rank of a random matrix over a finite field
Cooper, C. (2000) · Random Structures and Algorithms · Cited by 87
On products and powers of linear codes under componentwise multiplication
Randriambololona, H. (2015) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/637/12749 · Cited by 81
Self-citationSquares of Random Linear Codes
Cascudo, I., Cramer, R., Mirandola, D., & Zémor, G. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2393251 · Cited by 71
Research works printed but not linked: 4
- Goppa, V.D.: A new class of linear correcting codes. Probl. Peredači Informacii 6(3), 24–30 (1970)
- Green, M., Lazarsfeld, R.: Some results on the syzygies of finite sets and algebraic curves. Compos. Math. 67(3), 301–314 (1988)
- Johnsen, T., Verdure, H.: Stanley-Reisner resolution of constant weight linear codes. DCC 72(2), 471–481 (2014)
- Marquez-Corbella, I., Pellikaan, R.: Error-correcting pairs for a public-key cryptosystem. In: Code-based Cryptography Workshop 2012, 9–11 May 2012, Lyngby, Denmark (2012)
Cited by
Status report on the fourth round of the NIST post-quantum cryptography standardization process
Alagic, G., Bros, M., Ciadoux, P., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., et al. (2025) · doi:10.6028/nist.ir.8545 · Cited by 211
Metadata
- Authors
- Randriambololona, H.
- Corresponding author
- Randriambololona, Hugues
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Nature Switzerland
- Published
- 2025
- Volume
- 15606
- Pages
- 324-354
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4409846488
- Cited by
- 11
- References
- 21
- Citations by year
- 2026: 9 · 2025: 2
- FWCI
- 10.52
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- cc-by
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion, cc-by)
- HAL (submittedVersion, cc-by)
- arXiv (Cornell University) (cc-by)
- Funders
- Agence Nationale de la Recherche (ANR-21-CE39-0009, ANR-21-CE39-0008)
- Télécom Paris
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Keywords
- McEliece cryptosystem, code-based cryptography, post-quantum cryptography, alternant codes, Goppa codes, graded Betti numbers, homogeneous coordinate ring, error correction capability, Classic McEliece
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: The syzygy Distinguisher. https://app.cochat.ai/papers/10.1007/978-3-031-91095-1_12
- The paper
- Randriambololona, H. (2025). The syzygy Distinguisher. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-031-91095-1_12
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.