Hyperchaotic encryption based on multi-scroll piecewise linear systems
Open accessThe 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
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.
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?
Multi-scroll chaotic maps can create many chaotic attractors and reach a more complex and random context than single-scroll chaotic systems.
“However, in contrast, multi-scroll chaotic maps can create many chaotic attractors; thus, the multi-scroll chaotic map can reach a more complex and random context.”
From Image adaptive encryption using EfficientNet B3 feature guided multi scroll chaotic map with modulo controlled pseudo parallel processing (2025) · cites this paper as [23]
Section 2 describes generating attractors with more scrolls by adding subsystems. Section 3 says that increasing the number of scrolls makes the dynamics more complex and reports better pseudorandom-sequence test results for four- and ten-scroll systems than for two- or three-scroll systems. The paper does not compare these systems with single-scroll systems, and it describes multiple scrolls within an attractor rather than multiple distinct chaotic attractors. (LLM, conf=0.85)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 39 · Cited by 59
Research works printed but not linked: 1
- [37]37. IEEE computer society, IEEE standard for binary floating-point arithmetic, ansi/IEEE std 754, 1985, http://ieeexplore.ieee.org/xpl/articleDetails.jsp? arnumber=30711&filter%3DAND%28p_Publication_Number%3A2355%29.
- Authors
- García-Martínez, M., Ontañón-García, L. J., Campos-Cantón, E., & Čelikovský, S.
- Affiliations
- Institute for Scientific and Technological Research (MX)
- Czech Academy of Sciences (CZ)
- Corresponding author
- García-Martínez, M.
- Venue
- Applied Mathematics and Computation
- Publisher
- Elsevier BV
- Published
- 2015-11
- Volume
- 270
- Pages
- 413-424
- ISSN
- 0096-3003 (ISSN-L)
- OpenAlex
- W1207136572
- Cited by
- 59
- References
- 39
- Citations by year
- 2025: 4 · 2024: 3 · 2023: 7 · 2022: 6 · 2021: 11 · 2020: 5 · 2019: 7 · 2018: 5 · 2017: 6 · 2016: 5
- FWCI
- 4.63
- Type
- journal article
- Language
- en
- Open access
- green
- hdl.handle.net
- Licence
- public-domain
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- Locations
- Applied Mathematics and Computation (publishedVersion)
- ASEP (submittedVersion, public-domain)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- Czech Science Foundation (13-20433S)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Keywords
- hyperchaotic systems, image encryption, symmetric encryption, pseudorandom sequence generation, switching law, NIST statistical tests, grayscale image encryption, four-dimensional systems
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
