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

Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks

Esgin, Muhammed F., Kara, Orhun·2016·Lecture Notes in Computer Science
DOI 10.1007/978-3-319-31301-6_4
Open this paper in CoChat — free account

Integrity signals

Registry

Crossref · 10.1007/978-3-319-31301-6_4

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?

  • Because the key does not affect independently and proportionally the internal state of Sprout, TMDTO attacks were applied successfully to Sprout.

    “Because the key does not affect independently (and proportionally) the internal state of Sprout, TMDTO attacks were applied successfully to Sprout [17,21].”

    From Fruit-80: A Secure Ultra-Lightweight Stream Cipher for Constrained Environments (2018) · cites this paper as [17]

Cited by

Sorted by citations

Authors
Esgin, M. F., & Kara, O.
Affiliations
  • Istanbul Şehir University (TR)
  • Türkiye Bilimsel ve Teknolojik Araştırma Kurumu (TR)
Corresponding author
Esgin, Muhammed F.
ORCID
Venue
Lecture Notes in Computer Science
Publisher
Springer International Publishing
Published
2016
Pages
67-85
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
DOI
10.1007/978-3-319-31301-6_4
OpenAlex
W2397074368
Cited by
42
References
0
Citations by year
2026: 4 · 2025: 2 · 2023: 3 · 2022: 5 · 2021: 5 · 2020: 6 · 2019: 2 · 2018: 5 · 2017: 7 · 2015: 3
FWCI
2.51
Type
conference paper
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
  • Lecture notes in computer science (publishedVersion)
  • Istanbul Şehir University Institutional Repository (Istanbul Şehir University) (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
cryptanalysis, equivalence classes, key recovery, guess-and-determine attack, linear equations, 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