Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 171

The DOI matches its Crossref record.

Improved “exhaustive search” attacks on stream ciphers

Babbage, S.H.·1995·European Convention on Security and Detection

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1049/cp:19950490

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 171

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.