CoChat
Sign Up
Cited by 61Cryptographic Implementations and SecurityCoding theory and cryptographyCryptography and Residue Arithmetic

Improved Meet-in-the-Middle Attacks on Reduced-Round DES

Open access
Dunkelman, Orr, Sekar, Gautham, Preneel, Bart·2007·Lecture Notes in Computer Science
DOI 10.1007/978-3-540-77026-8_8
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-540-77026-8_8

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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 [24]

The citation lists haven’t been fetched yet

References 21 · Cited by 61

Authors
Dunkelman, O., Sekar, G., & Preneel, B.
Affiliations
KU Leuven (BE)
ORCID
Dunkelman, Orr
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2007-11-30
Volume
4859
Pages
86-100
DOI
10.1007/978-3-540-77026-8_8
OpenAlex
W1954145964
Cited by
61
References
21
Citations by year
2026: 2 · 2025: 3 · 2024: 3 · 2023: 7 · 2022: 1 · 2021: 3 · 2020: 1 · 2019: 4 · 2018: 2 · 2016: 4 · 2015: 5 · 2014: 5 · 2013: 5 · 2012: 6
FWCI
1.08
Type
conference paper
Language
en
Open access
Licence
other-oa
Locations
  • Springer eBooks (publishedVersion)
  • Lirias (acceptedVersion, other-oa)
  • Lecture notes in computer science
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, Data Encryption Standard, block cipher cryptanalysis

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