Binary image encoding using 1D chaotic maps
Abstract
Information security has become a major issue during the last decades where new algorithms based on algebraic methods or chaotic dynamics were suggested for encryption. This paper presents an algorithm for encoding binary images using one-dimensional chaotic maps. In order to perform pixel value permutation, the approach presented uses the diffusion property of chaotic maps, where local information is spread out. Comparison in terms of the correlation between the initial image and the transformed images is provided for different degrees of chaocity which corresponds to different values of positive Lyapunov exponent. Since images present a special kind of data where the size may be much larger than text data, an algorithm is suggested that emphasizes fast calculation in order to be implemented in real time for binary images encryption.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
A binary-image encryption algorithm using chaotic mapping based on a modified sine function can quickly encrypt binary images in real time.
“The algorithm can quickly encrypt binary images in real time.”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [96]
Cited by
Sorted by citations
Chaos-based image encryption algorithm
Guan, Z.-H., Huang, F., & Guan, W. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.08.006 · Cited by 726 · see citing works
Chaos-Based Image Encryption: Review, Application, and Challenges
Zhang, B., & Liu, L. (2023) · Mathematics · doi:10.3390/math11112585 · Cited by 328 · see citing works
- Authors
- Belkhouche, F., & Qidwai, U.
- Affiliations
- Tulane University (US)
- Venue
- Annual Technical Conference IEEE Region 5, 2003
- Publisher
- IEEE
- Published
- 2003-08-27
- Pages
- 39-43
- OpenAlex
- W2127216059
- Cited by
- 43
- References
- 0
- Citations by year
- 2022: 1 · 2021: 4 · 2020: 2 · 2019: 1 · 2018: 1 · 2017: 5 · 2016: 6 · 2015: 1 · 2014: 3 · 2013: 2 · 2012: 3
- FWCI
- 0.74
- Type
- conference paper
- Language
- en
- Open access
- closed
- 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 › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Keywords
- one-dimensional chaotic maps, Lyapunov exponents, correlation analysis, real-time encryption
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