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

Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds

Biryukov, Alex, Dunkelman, Orr, Keller, Nathan, Khovratovich, Dmitry, Shamir, Adi·2010·Lecture Notes in Computer Science
DOI 10.1007/978-3-642-13190-5_15
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-642-13190-5_15

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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 analysis of AES with local collisions is only applicable to the related-key model.

    “So far the most well-known attempt is the analysis of AES with local collisions [8][9][10][11], but it is only applicable to the relatedkey model.”

    From Biclique Cryptanalysis of the Full AES (2011) · cites this paper as [8]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., & Shamir, A.
Affiliations
  • University of Luxembourg (LU)
  • École Normale Supérieure - PSL (FR)
  • Hebrew University of Jerusalem (IL)
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2010
Pages
299-319
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-642-13190-5_15
OpenAlex
W1497481941
Cited by
185
References
1
Citations by year
2026: 2 · 2025: 8 · 2024: 4 · 2023: 7 · 2022: 8 · 2021: 8 · 2020: 9 · 2019: 13 · 2018: 7 · 2017: 9 · 2016: 6 · 2015: 18 · 2014: 21 · 2013: 14 · 2012: 14
FWCI
16.29
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
AES-256, key recovery attack, related-key attacks, block cipher security, key size

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