The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS
Abstract
Symmetric block encryption schemes, designed on invertible two-dimensional chaotic maps on a torus or a square, prove feasible and secure for real-time image encryption according to the commonly used criteria given in the literature. In this paper, a typical map of this kind, namely, the baker map, is further extended to be three-dimensional and then used to speed up image encryption while retaining its high degree of security. The proposed algorithm is described in detail, along with its security analysis and implementation. Experimental results show that this three-dimensional baker map is 2–3 times faster than the two-dimensional one, showing its great potential in real-time image encryption applications.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“As shown, the average correlation coefficient of the proposed system is less than all of the other methods.”
From Chaotic Image Encryption Design Using Tompkins-Paige Algorithm (2009) · cites this paper as [6]
In the citing paper
“As shown in Table 4 our proposed method with 0.09% difference to the expected value of NPCR is improved compared to the other reported methods.”
From Chaotic Image Encryption Design Using Tompkins-Paige Algorithm (2009) · cites this paper as [6]
In the citing paper
“The permuted image however cannot resist against “statistical” and “known plain text” attacks 6 .”
From Chaotic Image Encryption Design Using Tompkins-Paige Algorithm (2009) · cites this paper as [6]
In the citing paper
“Yaobin Mao and Guangrong Chen [38], based on the achievement of F. Pichler and J. Scharingers [43], further extended a two-dimensional Baker map to three dimensions with better chaotic characteristics in LE for fast image encryption while retaining its high security.”
From Chaos-Based Image Encryption: Review, Application, and Challenges (2023) · cites this paper as [43]
Citations
Cites
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Applied cryptography: Protocols, algorithms, and source code in C
(1994) · Computer Law & Security Report · doi:10.1016/0267-3649(94)90017-5 · Cited by 3,411
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×
“Recently, the idea of using chaos in data encryption has been introduced and discussed in, for instance, [Fridrich, 1997, 1998; Li et al., 2002; Mao & Chen, 2004, Chen et al., 2004; Scharinger, 1998].”
MethodSelf-citationSymmetric Ciphers Based on Two-Dimensional Chaotic Maps
Fridrich, J. (1998) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812749800098x · Cited by 1,917 · cited 11×
“It has been shown that chaos-based algorithms have advantages in applications of bulk data encryption, which make use of two special features of chaotic maps — the sensitivity to initial conditions and parameters and the mixing property (topological transitivity or ergodicity), [Fridrich, 1998; Kocarev, 2001; Kocarev…”
BackgroundMethodInfluentialChaos-based cryptography: a brief overview
Kocarev, L. (2001) · IEEE Circuits and Systems Magazine · doi:10.1109/7384.963463 · Cited by 901 · cited 2×
“…applications of bulk data encryption, which make use of two special features of chaotic maps — the sensitivity to initial conditions and parameters and the mixing property (topological transitivity or ergodicity), [Fridrich, 1998; Kocarev, 2001; Kocarev & Jakimovski, 2001; Masuda & Aihara, 2002].”
MethodChaos and cryptography: block encryption ciphers based on chaotic maps
Jakimoski, G., & Kocarev, L. (2001) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.904880 · Cited by 673
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 · Cited by 265 · cited 1×
“…applications of bulk data encryption, which make use of two special features of chaotic maps — the sensitivity to initial conditions and parameters and the mixing property (topological transitivity or ergodicity), [Fridrich, 1998; Kocarev, 2001; Kocarev & Jakimovski, 2001; Masuda & Aihara, 2002].”
MethodFast encryption of image data using chaotic Kolmogorov flows
Scharinger, J. (1998) · Journal of Electronic Imaging · doi:10.1117/1.482647 · Cited by 186
Mao, Y., & Chen, G. (2005) · Springer eBooks · doi:10.1007/3-540-28247-5_8 · Cited by 168
Self-citationChaotic encryption scheme for real-time digital video
Li, S., Zheng, X., Mou, X., & Cai, Y. (2002) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.458527 · Cited by 129 · cited 2×
“Recently, the idea of using chaos in data encryption has been introduced and discussed in, for instance, [Fridrich, 1997, 1998; Li et al., 2002; Mao & Chen, 2004, Chen et al., 2004; Scharinger, 1998].”
Method
Research works printed but not linked: 4
- Fridrich J., 1997, Secure Image Ciphering Based on Chaos: Final Report for AFRL
- Kocarev L., IEEE Trans. Circuits Syst.-I, 48, 163
- Mao Y. B., 2004, Handbook of Computational Geometry for Pattern Recognition, Computer Vision, Neurocomputing and Robotics
- Pichler F., 1995, 9, 249
Cited by
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119
“A variation of differential cryptanalysis applied to image encryption can be found for instance in [Chen et al. , 2004; Mao et al. , 2004].”
MethodA 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
“It has been proved that in many aspects chaotic maps have analogous but different characteristics as compared with conventional encryption algorithms [8,9,12,13].”
BackgroundSelf-citation(2011) · Cited by 904
Local Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722
“Image randomness can be measured using a variety of methods, such as histogram analysis [6,12,16,22,28,29,35,37,40,42,54,55,57,60,63,64], global Shannon entropy measure [6,12,42,55,64,66], adjacent pixel correlations [6,12,16,35,42,57,64,66].”
MethodA new image encryption algorithm based on hyper-chaos
Gao, T., & Chen, Z. (2008) · Physics Letters A · doi:10.1016/j.physleta.2007.07.040 · Cited by 629
Metadata
- Authors
- MAO, Y., CHEN, G., & LIAN, S.
- Affiliations
- Nanjing University of Science and Technology (CN)
- City University of Hong Kong (HK)
- Venue
- International Journal of Bifurcation and Chaos
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2004-10
- Volume
- 14
- Issue
- 10
- Pages
- 3613-3624
- ISSN
- 0218-1274 (ISSN-L)
- 1793-6551
- OpenAlex
- W2032820503
- Cited by
- 611
- References
- 10
- Citations by year
- 2026: 12 · 2025: 11 · 2024: 13 · 2023: 14 · 2022: 25 · 2021: 28 · 2020: 38 · 2019: 37 · 2018: 33 · 2017: 32 · 2016: 30 · 2015: 34 · 2014: 41 · 2013: 44 · 2012: 47
- FWCI
- 13.38
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- International Journal of Bifurcation and Chaos (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
- Keywords
- image encryption, chaotic maps, real-time encryption, encryption speed, security analysis, two-dimensional chaotic map
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 NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS. https://app.cochat.ai/papers/10.1142/s021812740401151x
- The paper
- MAO, Y., CHEN, G., & LIAN, S. (2004). A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS. International Journal of Bifurcation and Chaos. https://doi.org/10.1142/s021812740401151x
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.