The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Related-Key Boomerang and Rectangle Attacks
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.
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
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · cited 1×
“, AES with 192-bit keys), we describe the key schedule for AES-192: Let the supplied key be 6 words of 32-bits (W [0],W [1], · · · ,W [5]).”
MethodSelf-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
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
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
Self-citation
Cited by
Piccolo: An Ultra-Lightweight Blockcipher
Shibutani, K., Isobe, T., Hiwatari, H., Mitsuda, A., Akishita, T., & Shirai, T. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_23 · Cited by 546
The 128-Bit Blockcipher CLEFIA (Extended Abstract)
Shirai, T., Shibutani, K., Akishita, T., Moriai, S., & Iwata, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74619-5_12 · Cited by 487
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
Distinguisher and Related-Key Attack on the Full AES-256
Biryukov, A., Khovratovich, D., & Nikolić, I. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_14 · Cited by 329
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
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., & Shamir, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_15 · Cited by 185
Self-citationA 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
Self-citationBiryukov, A., & Nikolić, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_17 · Cited by 110
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
- Biham, E., Dunkelman, O., & Keller, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 507-525
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1515958737
- Cited by
- 217
- References
- 4
- FWCI
- 8.59
- 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
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.