The DOI matches its Crossref record.
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
Courtois, N. T., & Pieprzyk, J. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_17 · Cited by 688
Self-citationCube Attacks on Tweakable Black Box Polynomials
Dinur, I., & Shamir, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_16 · Cited by 451
Self-citationStatus 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
Post Quantum Cryptography: A Review of Techniques, Challenges and Standardizations
Bavdekar, R., Jayant Chopde, E., Agrawal, A., Bhatia, A., & Tiwari, K. (2023) · 2023 International Conference on Information Networking (ICOIN) · doi:10.1109/icoin56518.2023.10048976 · Cited by 108
Metadata
- Authors
- Courtois, N., Klimov, A., Patarin, J., & Shamir, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 392-407
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1583871653
- Cited by
- 753
- References
- 0
- FWCI
- 9.81
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. https://app.cochat.ai/papers/10.1007/3-540-45539-6_27
- The paper
- Courtois, N., Klimov, A., Patarin, J., & Shamir, A. (2000). Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45539-6_27
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.
