The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
The Block Cipher Companion
Overview
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
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 3×
“1949 [680] introduced the twin ideas of confusion and diffusion for practical cipher design.”
BackgroundMethodInfluentialDifferential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · cited 1×
“Descriptions and surveys [414, 435, 545, 691] Early cryptanalysis [106, 145, 161, 193, 194, 199, 201, 209, 231, 238] [290, 348, 511, 620, 621, 622, 629, 660, 761] Mature cryptanalysis [48, 54, 55, 77, 78, 81, 82, 110, 195, 381, 385] [394, 420, 475, 476, 477, 617, 669, 682] Design insights [46, 124, 128, 129, 133, 166,…”
BackgroundPRESENT: 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
Self-citationLinear 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 6×
“Differential-based attacks [59, 81, 328, 391, 433, 531, 729] Linear-based attacks [437, 476] Block cipher structure [184, 453, 478] S-box design [147, 375, 563, 564, 571]”
BackgroundMethodInfluentialCanright, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11545262_32 · Cited by 530
Related-Key Cryptanalysis of the Full AES-192 and AES-256
Biryukov, A., & Khovratovich, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_1 · Cited by 482
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 · cited 5×
“devised a related-key attack which could potentially break AES-256 up to nine rounds [240].”
BackgroundInfluentialA 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
Miss in the Middle Attacks on IDEA and Khufu
Biham, E., Biryukov, A., & Shamir, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48519-8_10 · Cited by 162 · cited 1×
“now been fairly well studied and a number of cryptanalytic results have been established [81, 257, 58, 729].”
BackgroundA Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
Dunkelman, O., Keller, N., & Shamir, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_21 · Cited by 155
Cited by
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
A New Hyperchaotic System-Based Design for Efficient Bijective Substitution-Boxes
Al Solami, E., Ahmad, M., Volos, C., Doja, M. N., & Beg, M. M. S. (2018) · Entropy · doi:10.3390/e20070525 · Cited by 113
A New 1D Chaotic Map and $\beta$ -Hill Climbing for Generating Substitution-Boxes
Alzaidi, A. A., Ahmad, M., Doja, M. N., Solami, E. A., & Beg, M. M. S. (2018) · IEEE Access · doi:10.1109/access.2018.2871557 · Cited by 108
Ahmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 71
“The combination of S-boxes and P-boxes across multiple rounds makes the cipher strong and powerful [9].”
Background
Metadata
- Authors
- Knudsen, L. R., & Robshaw, M. J. B.
- Venue
- Information Security and Cryptography
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- ISSN
- 1619-7100 (ISSN-L)
- OpenAlex
- W577451423
- Cited by
- 162
- References
- 10
- FWCI
- 3.39
- Type
- book
- 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.