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

Automatic Search of Attacks on Round-Reduced AES and Applications

Bouillaguet, Charles, Derbez, Patrick, Fouque, Pierre-Alain·2011·Lecture Notes in Computer Science
DOI 10.1007/978-3-642-22792-9_10
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-642-22792-9_10

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?

  • 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 [14]

Cited by

Sorted by citations

Authors
Bouillaguet, C., Derbez, P., & Fouque, P.-A.
Affiliations
Centre National de la Recherche Scientifique (FR)
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2011
Volume
6841
Pages
169-187
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-642-22792-9_10
OpenAlex
W98505615
Cited by
96
References
0
Citations by year
2026: 4 · 2025: 4 · 2024: 6 · 2023: 10 · 2022: 8 · 2021: 5 · 2020: 6 · 2019: 3 · 2018: 7 · 2017: 6 · 2016: 4 · 2015: 4 · 2014: 10 · 2013: 10 · 2012: 6
FWCI
7.26
Type
conference paper
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Lecture notes in computer science (publishedVersion)
  • HAL (submittedVersion)
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, automated cryptanalysis, guess-and-determine attack, meet-in-the-middle attack, fault injection attacks

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