Cited by 30Cryptographic Implementations and SecurityCoding theory and cryptographyCryptography and Residue Arithmetic

Design and analysis of small-state grain-like stream ciphers

Hamann, Matthias, Krause, Matthias, Meier, Willi, Zhang, Bin·2018·Cryptography and Communications

Integrity signals

Registry

Crossref · 10.1007/s12095-017-0261-6

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?

  • Two trivial key recovery attacks were proposed on Fruit with computational complexities of 2^82.6 and 2^67.5 clocks of Fruit, respectively.

    “Two trivial key recovery attacks were proposed on Fruit. The computational complexities of the first and second attacks were 2^82.6 and 2^67.5 clocks of Fruit, respectively [22,24].”
  • A TMDTO distinguishing attack was successfully applied to all of the ultra-lightweight stream ciphers.

    “A TMDTO distinguishing attack was successfully applied to all of the ultra-lightweight stream ciphers [24], but we propose two countermeasures that can strengthen Fruit-80 against TMDTO distinguishing attacks.”
  • In this structure, there is no vulnerability regarded from using the same IVs twice with the same key.

    “In this structure, there is no vulnerability regarded from using the same IVs twice with the same key [24].”
  • The new idea was to use IV bits not only in the initialization but also in the keystream generation.

    “The new idea was to use IV bits not only in the initialization but also in the keystream generation.”
  • Permanently using IV, similar to the key, in the internal state updating.

    “In other words, the new idea was permanently using IV (similar to the key) in the internal state updating [24].”

Cited by

Sorted by citations

Authors
Hamann, M., Krause, M., Meier, W., & Zhang, B.
Affiliations
  • University of Mannheim (DE)
  • FHNW University of Applied Sciences and Arts Northwestern Switzerland (CH)
  • Chinese Academy of Sciences (CN)
Corresponding author
Meier, Willi
Venue
Cryptography and Communications
Published
2017-11-08
Volume
10
Issue
5
Pages
803-834
ISSN
  • 1936-2447 (ISSN-L)
  • 1936-2455
OpenAlex
W2767998798
Cited by
30
References
0
Citations by year
2026: 3 · 2025: 2 · 2024: 1 · 2023: 5 · 2022: 7 · 2021: 1 · 2020: 4 · 2019: 3 · 2018: 4
FWCI
1.80
Type
journal article
Language
en
Open access
closed
Locations
  • Cryptography and Communications (publishedVersion)
  • MADOC (University of Mannheim) (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
birthday bound, distinguishers, key recovery attack, plantlets, fruits, lightweight cryptography, weak keys, stream cipher design

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