Improved Meet-in-the-Middle Attacks on AES
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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 fastest single-key attacks on round-reduced AES variants so far are only slightly more powerful than those proposed 10 years ago.
“Though many papers have been published on the cryptanalysis of AES, the fastest single-key attacks on round-reduced AES variants [20,33] so far are only slightly more powerful than those proposed 10 years ago [23,24].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [20]
The Square attack and its variations resulted in the cryptanalysis of round-reduced AES variants with lowest computational complexity to date.
“The Square attack and its variations such as integral attack and multiset attack resulted in the cryptanalysis of round-reduced AES variants with lowest computational complexity to date, while the first attack on 8-round AES-192 with non-marginal data complexity has appeared only recently [20].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [20]
The first attack on 8-round AES-192 with non-marginal data complexity has appeared only recently.
“The Square attack and its variations such as integral attack and multiset attack resulted in the cryptanalysis of round-reduced AES variants with lowest computational complexity to date, while the first attack on 8-round AES-192 with non-marginal data complexity has appeared only recently [20].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [20]
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 [20]
There are only a few examples in the literature where key-schedule properties are used in the single-key setting.
“Whereas using key-schedule properties in related-key attacks is natural, there seem only a few examples in the literature where this is used in the arguably more relevant single-key setting.This includes the attack on the self-synchronized stream cipher Moustique [28], the lightweight block cipher KTANTAN [12], and recent improvements upon attacks on 8-rounds of AES-192 and AES-256 [20].”
From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [20]
Cites
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 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Biclique 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 · see citing works
- Authors
- Demirci, H., Taşkın, İ., Çoban, M., & Baysal, A.
- Affiliations
- Türkiye Bilimsel ve Teknolojik Araştırma Kurumu (TR)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 144-156
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1527814980
- Cited by
- 47
- References
- 1
- Citations by year
- 2026: 1 · 2024: 1 · 2023: 1 · 2022: 2 · 2018: 3 · 2017: 5 · 2016: 5 · 2015: 5 · 2014: 4 · 2013: 5 · 2012: 5
- FWCI
- 3.47
- Type
- conference paper
- Language
- en
- Open access
- closed
- 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
- meet-in-the-middle attack, AES, block cipher cryptanalysis, distinguishers, constant propagation, AES-128, AES-192, AES-256, precomputation, space complexity
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
