Cited by 1,044Chaos-based Image/Signal EncryptionMathematical Dynamics and FractalsChaos control and synchronization

ON THE DERIVATION OF A “CHAOTIC” ENCRYPTION ALGORITHM

Matthews, Robert·1989·Cryptologia

Abstract

Under certain conditions, even simple non-linear iterative functions are capable of generating “chaotic” sequences of random numbers. In this paper we derive such a “chaotic” function, and show that it may be suitable for cryptographic use, in particular as a replacement for the one-time pad system.

Integrity signals

Registry

Crossref · 10.1080/0161-118991863745

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, 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?

Cited by

Sorted by citations

Authors
Matthews, R.
Corresponding author
Matthews, Robert
Venue
Cryptologia
Published
1989-01
Volume
13
Issue
1
Pages
29-42
ISSN
  • 0161-1194 (ISSN-L)
  • 1558-1586
OpenAlex
W2010620862
Cited by
1,044
References
0
Citations by year
2026: 32 · 2025: 62 · 2024: 72 · 2023: 73 · 2022: 72 · 2021: 79 · 2020: 60 · 2019: 72 · 2018: 68 · 2017: 48 · 2016: 37 · 2015: 40 · 2014: 49 · 2013: 43 · 2012: 33
FWCI
0.54
Type
journal article
Language
en
Open access
closed
Locations
Cryptologia (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
Keywords
chaos-based cryptography, chaotic maps, pseudorandom number generation, one-time pad, stream ciphers

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