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

The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.

Cryptosystems with discretized chaotic maps

Masuda, N., Aihara, K.·2002·IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
DOI 10.1109/81.974872
Open this paper in CoChat — free account

Abstract

Many kinds of chaotic cryptosystems have been proposed. Chaotic systems dissipate information due to orbital instability with positive Lyapunov exponents and ergodicity. If these properties are appropriately utilized, chaotic cryptosystems are supposed to realize high security. However, most of the existing secure communication techniques using chaos do not have enough security. For example, secure communication protocols based on chaos synchronization require robustness which gives useful information to attackers. The cryptosystems based on direct applications of chaotic maps have been weak against linear and differential cryptoanalysis. In this paper, a new kind of chaotic cryptosystem which overcomes these difficulties to some extent is proposed. The cryptosystem is based on a discretization of the skew tent map. We also show some of the desirable properties of the proposed cryptosystem using dynamical characteristics. These properties regarding ciphertext randomness may be closely related to the cryptological security. Our new cryptosystem uses one step to connect the theory of commonly used cryptosystems and dynamical system theory.

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.1109/81.974872

Cites

27 of 27 references verified0 citation errors · 0 not checkable

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

Cites

Show all 27 references

Cited by

See all 265

Metadata

Authors
Masuda, N., & Aihara, K.
Venue
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2002
Volume
49
Issue
1
Pages
28-40
ISSN
1057-7122 (ISSN-L)
DOI
10.1109/81.974872
OpenAlex
W2166934960
Cited by
265
References
27
FWCI
11.23
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: Cryptosystems with discretized chaotic maps. https://app.cochat.ai/papers/10.1109/81.974872
The paper
Masuda, N., & Aihara, K. (2002). Cryptosystems with discretized chaotic maps. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. https://doi.org/10.1109/81.974872

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.