A Review on Applications of Chaotic Maps in Pseudo-Random Number Generators and Encryption
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Because of the COVID-19 pandemic, most of the tasks have shifted to an online platform. Sectors such as e-commerce, sensitive multi-media transfer, online banking have skyrocketed. Because of this, there is an urgent need to develop highly secure algorithms which can not be hacked into by unauthorized users. The method which is the backbone for building encryption algorithms is the pseudo-random number generator based on chaotic maps. Chaotic maps are mathematical functions that generate a highly arbitrary pattern based on the initial seed value. This manuscript gives a summary of how the chaotic maps are used to generate pseudo-random numbers and perform multimedia encryption. After carefully analyzing all the recent literature, we found that the lowest correlation coefficient was 0.00006, which was achieved by Ikeda chaotic map. The highest entropy was 7.999995 bits per byte using the quantum chaotic map. The lowest execution time observed was 0.23 seconds with the Zaslavsky chaotic map and the highest data rate was 15.367 Mbits per second using a hyperchaotic map. Chaotic map-based pseudo-random number generation can be utilized in multi-media encryption, video-game animations, digital marketing, chaotic system simulation, chaotic missile systems, and other applications.
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.
Integrity signals
Registry
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.
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
A symmetric image encryption scheme based on 3D chaotic cat maps
Chen, G., Mao, Y., & Chui, C. K. (2004) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2003.12.022 · Cited by 2,092 · cited 1×
“[47]havingacorrelationcoefficient of0.”
Cosine-transform-based chaotic system for image encryption
Hua, Z., Zhou, Y., & Huang, H. (2019) · Information Sciences · doi:10.1016/j.ins.2018.12.048 · Cited by 776 · cited 2×
“Hua et al. [31] have designed a cosine-transform-based chaotic system for image encryption.”
BackgroundMethodCryptanalysis of a Chaotic Image Encryption Algorithm Based on Information Entropy
Li, C., Lin, D., Feng, B., Lu, J., & Hao, F. (2018) · IEEE Access · doi:10.1109/access.2018.2883690 · Cited by 247 · cited 1×
“The chaotic function-based pseudo-random number generator is useful for avoiding data mining for unauthorized personnel [17,18].”
Cited by
Kıran, H. E. (2024) · Chaos and Fractals · doi:10.69882/adba.chf.2024072 · Cited by 25
Metadata
- Authors
- Naik, R. B., & Singh, U.
- Venue
- Annals of Data Science
- Published
- 2022-01-18
- Volume
- 11
- Issue
- 1
- Pages
- 25-50
- ISSN
- 2198-5804 (ISSN-L)
- 2198-5812
- OpenAlex
- W4206253007
- Cited by
- 190
- References
- 3
- FWCI
- 11.74
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A Review on Applications of Chaotic Maps in Pseudo-Random Number Generators and Encryption. https://app.cochat.ai/papers/10.1007/s40745-021-00364-7
- The paper
- Naik, R. B., & Singh, U. (2024). A Review on Applications of Chaotic Maps in Pseudo-Random Number Generators and Encryption. Annals of Data Science. https://doi.org/10.1007/s40745-021-00364-7
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.