The DOI matches its Crossref record.
Improved “exhaustive search” attacks on stream ciphers
Abstract
Given a certain amount of known keystream from a keystream generator (KG), the most obvious way to determine the state of the generator is to search through all possible states, checking for a match between the resulting and observed keystream. In this paper, we draw attention to two attacks on stream cipher systems which, although their complexity grows exponentially with the size of the KG state, are more efficient than a simple-minded search through all possible KG states. Indeed, given sufficient storage and sufficient known keystream, each attack can almost halve the effective entropy of the state to be searched.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Real Time Cryptanalysis of A5/1 on a PC
Biryukov, A., Shamir, A., & Wagner, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44706-7_1 · Cited by 452
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
Biryukov, A., & Shamir, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_1 · Cited by 339
Babbage, S., & Dodd, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_15 · Cited by 143
Self-citationLIZARD—A lightweight stream cipher for power-constrained devices
Hamann, M., Krause, M., & Meier, W. (2017) · IACR Transactions on Symmetric Cryptology · doi:10.46586/tosc.v2017.i1.45-79 · Cited by 121
Practical Cryptanalysis of Full Sprout with TMD Tradeoff Attacks
Esgin, M. F., & Kara, O. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-31301-6_4 · Cited by 42
Metadata
- Authors
- Babbage, S. H.
- Venue
- European Convention on Security and Detection
- Publisher
- IEE
- Published
- 1995
- Volume
- 1995
- Pages
- 161-166
- OpenAlex
- W2006824395
- Cited by
- 171
- References
- 0
- FWCI
- 0.00
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Improved “exhaustive search” attacks on stream ciphers. https://app.cochat.ai/papers/10.1049/cp:19950490
- The paper
- Babbage, S. H. (1995). Improved “exhaustive search” attacks on stream ciphers. European Convention on Security and Detection. https://doi.org/10.1049/cp%3A19950490
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.