The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
Open accessOverview
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
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 5×
“According to Shannon's paradigm [25], a cipher is combination of some confusion and diffusion components.”
BackgroundMethodInfluentialMatrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
Differentially uniform mappings for cryptography
Nyberg, K. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_6 · Cited by 899
Cryptography and Computer Privacy
Feistel, H. (1973) · Scientific American · doi:10.1038/scientificamerican0573-15 · Cited by 777
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations
Courtois, N., Klimov, A., Patarin, J., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_27 · Cited by 753
Self-citationPatarin, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_4 · Cited by 662
Improved Cryptanalysis of Rijndael
Ferguson, N., Kelsey, J., Lucks, S., Schneier, B., Stay, M., Wagner, D., & Whiting, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_15 · Cited by 449
Serpent: A Proposal for the Advanced Encryption Standard
Anderson, R., Biham, E., & Knudsen, L. R. (1998) · Cited by 395
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88
Patarin, J. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_20 · Cited by 394
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
Cube 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
A Meet-in-the-Middle Attack on 8-Round AES
Demirci, H., & Selçuk, A. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_7 · Cited by 207
Automatic Search of Attacks on Round-Reduced AES and Applications
Bouillaguet, C., Derbez, P., & Fouque, P.-A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_10 · Cited by 96
Improved Meet-in-the-Middle Attacks on AES
Demirci, H., Taşkın, İ., Çoban, M., & Baysal, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10628-6_10 · Cited by 47
Metadata
- Authors
- Courtois, N. T., & Pieprzyk, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 267-287
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1542020576
- Cited by
- 688
- References
- 21
- FWCI
- 25.83
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. https://app.cochat.ai/papers/10.1007/3-540-36178-2_17
- The paper
- Courtois, N. T., & Pieprzyk, J. (2002). Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-36178-2_17
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.
