Cited by 162Cryptographic Implementations and SecurityCoding theory and cryptographyCryptography and Residue Arithmetic

Miss in the Middle Attacks on IDEA and Khufu

Open access
Biham, Eli, Biryukov, Alex, Shamir, Adi·1999·Lecture Notes in Computer Science

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/3-540-48519-8_10

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

  • With respect to AES, the most powerful single-key recovery methods designed so far are impossible differential cryptanalysis and Square attacks.

    “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]

  • Impossible differential cryptanalysis yielded the first attack on 7-round AES-128 with non-marginal data complexity.

    “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]

    The Abstract and §1 Introduction describe impossible-differential attacks on IDEA and Khufu, not AES-128. Searches for a first 7-round AES-128 attack and its data complexity found no passage addressing that result; the 7-round impossible differential mentioned in §4 concerns DES. (LLM, conf=0.76)

    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.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. C. M. Adams, S. E. Tavares, Designing S-boxes for Ciphers Resistant to Differen- tial Cryptanalysis, Proceedings of the 3rd symposium on State and Progress of Research in Cryptography, pp. 181-190, 1993.
  2. 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.
  3. 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

Authors
Biham, E., Biryukov, A., & Shamir, A.
Affiliations
Technion – Israel Institute of Technology (IL)
Corresponding author
Biham, Eli
Venue
Lecture Notes in Computer Science
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
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Computer Science › Artificial Intelligence › 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