CoChat

Generating Chaotic Secure Sequences with Desired Statistical Properties and High Security

Hong, Zhou, Xieting, Ling · 1997 · International Journal of Bifurcation and Chaos
Cited by 50

The DOI matches its Crossref record.

Abstract

This work proposes a class of one-dimensional analogue chaotic signals which have perfect statistical properties. A non-invertible transformation is introduced to generate a class of binary (symbolic) chaotic sequences with desired distribution function and correlation function. These binary chaotic secure sequences are proven to have near-ideal linear complexity and infinite large discrete correlation dimension, thus they cannot be reconstructed by linear-feedback shift-register (LFSR) techniques or nonlinear dynamics (NLD) forecasting in finite order.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1142/s0218127497000145

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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 50

Metadata

Authors
Hong, Z., & Xieting, L.
Venue
International Journal of Bifurcation and Chaos
Published
1997-01
Volume
07
Issue
01
Pages
205-213
ISSN
  • 0218-1274 (ISSN-L)
  • 1793-6551
OpenAlex
W2056383532
Cited by
50
References
0
FWCI
0.33
Type
journal article
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: Generating Chaotic Secure Sequences with Desired Statistical Properties and High Security. https://app.cochat.ai/papers/10.1142/s0218127497000145
The paper
Hong, Z., & Xieting, L. (1997). Generating Chaotic Secure Sequences with Desired Statistical Properties and High Security. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s0218127497000145

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.