The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The interpolation attack on block ciphers
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
Cites
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748
Cited by
HIGHT: A New Block Cipher Suitable for Low-Resource Device
Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.-S., Lee, C., Chang, D., Lee, J., Jeong, K., et al. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_4 · Cited by 708
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
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
Aoki, K., Ichikawa, T., Kanda, M., Matsui, M., Moriai, S., Nakajima, J., & Tokita, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44983-3_4 · Cited by 447
Waruiru, C. (2004) · Archives of Disease in Childhood · doi:10.1136/adc.2003.028449 · Cited by 422
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Albrecht, M., Grassi, L., Rechberger, C., Roy, A., & Tiessen, T. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-53887-6_7 · Cited by 258
Metadata
- Authors
- Jakobsen, T., & Knudsen, L. R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1997
- Pages
- 28-40
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1654806544
- Cited by
- 298
- References
- 1
- FWCI
- 10.53
- 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
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.
