The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Miss in the Middle Attacks on IDEA and Khufu
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“With respect to AES, probably the most powerful singlekey recovery methods designed so far are impossible differential cryptanalysis [5,33] and Square attacks [14,20].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [5]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“The impossible differential cryptanalysis yielded the first attack on 7-round AES-128 with non-marginal data complexity.”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [5]
Experimental — accuracy not yet measured
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 the Data Encryption Standard
Biham, E., & Adi Shamir, Z. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9314-6 · Cited by 1,049
Self-citationA Proposal for a New Block Encryption Standard
Lai, X., & Massey, J. L. (1991) · Lecture notes in computer science · doi:10.1007/3-540-46877-3_35 · Cited by 611
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Biham, E., Biryukov, A., & Adi Shamir, Z. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_2 · Cited by 570
Self-citationMarkov Ciphers and Differential Cryptanalysis
Lai, X., Massey, J. L., & Murphy, S. P. (2007) · Springer eBooks · doi:10.1007/3-540-46416-6_2 · Cited by 560
New types of cryptanalytic attacks using related keys
Biham, E. (1994) · Journal of Cryptology · doi:10.1007/bf00203965 · Cited by 470
Self-citationNew block encryption algorithm MISTY
Matsui, M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052334 · Cited by 364
On the design and security of block ciphers
Lai, X. (1992) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-a-000646711 · Cited by 290
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
Kelsey, J. M., Schneier, B., & Wagner, D. A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_19 · Cited by 251
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Biham, E., Biryukov, A., & Adi Shamir, Z. (2005) · Journal of Cryptology · doi:10.1007/s00145-005-0129-3 · Cited by 205
Self-citationProvable security against a differential attack
Nyberg, K., & Knudsen, L. R. (1995) · Journal of Cryptology · doi:10.1007/bf00204800 · Cited by 197
Research works printed but not linked: 3
- C. M. Adams, S. E. Tavares, Designing S-boxes for Ciphers Resistant to Differential Cryptanalysis, Proceedings of the 3rd symposium on State and Progress of Research in Cryptography, pp. 181–190, 1993.
- S. Miyaguchi, A. Shiraishi, A. Shimizu, Fast Data Encryption Algorithm FEAL-8, Review of Electrical Communications Laboratories, Vol. 36, No. 4, pp. 433–437, 1988.
- T. Shimoyama, S. Moriai, T. Kaneko, Improving the High Order Differential Attack and Cryptanalysis of the KN Cipher, Lecture Notes in Computer Science 1396, Proceedings of the First International Workshop on Information Security (ISW’97) (Japan), pp. 32–42, Springer-Verlag 1997.
Cited by
Sorted by citations
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Biham, E., Biryukov, A., & Adi Shamir, Z. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48910-x_2 · Cited by 570
Self-citationBiclique Cryptanalysis of the Full AES
Bogdanov, A., Khovratovich, D., & Rechberger, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_19 · Cited by 546
On Probability of Success in Linear and Differential Cryptanalysis
Selçuk, A. A. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-9013-7 · Cited by 251
SEA: A Scalable Encryption Algorithm for Small Embedded Applications
Standaert, F., Piret, G., Gershenfeld, N., & Quisquater, J.-J. (2006) · Lecture notes in computer science · doi:10.1007/11733447_16 · Cited by 227
Related-Key Boomerang and Rectangle Attacks
Biham, E., Dunkelman, O., & Keller, N. (2005) · Lecture notes in computer science · doi:10.1007/11426639_30 · Cited by 213
Self-citation
Metadata
- Authors
- Biham, E., Biryukov, A., & Shamir, A.
- Affiliations
- Technion – Israel Institute of Technology (IL)
- Corresponding author
- Biham, Eli
- ORCID
- Biryukov, Alex
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 124-138
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1541853791
- Cited by
- 162
- References
- 25
- Citations by year
- 2026: 3 · 2025: 5 · 2024: 9 · 2023: 6 · 2022: 1 · 2021: 3 · 2020: 4 · 2019: 5 · 2018: 4 · 2017: 4 · 2016: 5 · 2015: 7 · 2014: 6 · 2013: 9 · 2012: 13
- FWCI
- 3.10
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- cryptanalysis, impossible differentials, ideas, Khufu, block cipher, skipjack tuna, reduced-round attacks, block cipher security
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
