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

Some Results on Sprout

Banik, Subhadeep·2015·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-319-26617-6_7

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?

  • Some attacks were proposed to the Grain family and Sprout from the weakness that the LFSR can become all zeros just before producing the first bit of the keystream.

    “Some attacks were proposed to the Grain family and Sprout from this weakness (i.e., it is possible that the LFSR becomes all zeros just before producing the first bit of the keystream in the Grain family and Sprout) [16,29].”
  • There are weak key-IVs in all members of the Grain family and Sprout.

    “There are weak key-IVs in all members of the Grain family [29] and Sprout [16,33].”

Cited by

Sorted by citations

Authors
Banik, S.
Affiliations
Technical University of Denmark (DK)
Corresponding author
Banik, Subhadeep
Venue
Lecture Notes in Computer Science
Published
2015
Pages
124-139
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2397402334
Cited by
27
References
0
Citations by year
2026: 1 · 2025: 1 · 2023: 2 · 2022: 2 · 2021: 3 · 2020: 5 · 2019: 1 · 2018: 4 · 2017: 5 · 2016: 2 · 2015: 1
FWCI
2.25
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
lightweight stream cipher, key recovery attack, distinguishing attacks, linear feedback shift registers

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