Cited by 207Cryptographic Implementations and SecurityCoding theory and cryptographyAdversarial Robustness in Machine Learning

Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning

Gohr, Aron·2019·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-030-26951-7_6

Cites

2 of 2 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?

  • Gohr integrated the differential-neural distinguisher with classical differentials, facilitating a 12-round key recovery attack on SPECK32/64.

    “Gohr effectively integrated this distinguisher with classical differentials, facilitating a 12-round key recovery attack on SPECK32/64 (from a total of 22 rounds).”

    From Differential-Neural Cryptanalysis on AES (2024) · cites this paper as [1]

  • Gohr introduced the concept of differential-neural cryptanalysis.

    “In CRYPTO 2019, Gohr introduced the concept of differential-neural cryptanalysis [1].”

    From Differential-Neural Cryptanalysis on AES (2024) · cites this paper as [1]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Gohr, A.
Affiliations
Federal Office for Information Security (DE)
Corresponding author
Gohr, Aron
Venue
Lecture Notes in Computer Science
Published
2019
Pages
150-179
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2969001071
Cited by
207
References
2
Citations by year
2026: 34 · 2025: 36 · 2024: 42 · 2023: 29 · 2022: 30 · 2021: 29 · 2020: 6 · 2019: 1
FWCI
6.31
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 › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
lightweight block cipher, deep residual neural network, Markov assumption, Bayesian optimization, key search, chosen-plaintext attack

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