Chaotic Image Encryption Design Using Tompkins-Paige Algorithm
Open accessThe DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index; 1 of the 15 sources its claims cite were checked for support.
Abstract
In this paper, we have presented a new permutation-substitution image encryption architecture using chaotic maps and Tompkins-Paige algorithm. The proposed encryption system includes two major parts, chaotic pixels permutation and chaotic pixels substitution. ... Uniformity of the histogram of the proposed encrypted image is justified using the chi-square test, which is less than 𝜒 2 (255, 0.05). The vertical, horizontal, and diagonal correlation coefficients, as well as their average and RMS values for the proposed encrypted image are calculated...
Overview
CoChat Summary
TL;DR
The paper proposes a permutation–substitution image encryption architecture that uses a logistic map to drive a Tompkins-Paige permutation and a tent map to generate a pseudorandom image for modular-addition substitution. Simulations on a 128×128 Lena image show a uniform ciphertext histogram, low pixel correlations, and a 218-bit key space.
Key findings
- Histogram uniformity of the encrypted image passes the chi-square test: computed χ² = 290 against the threshold χ²(255, 0.05) = 293.
- Difference metrics: NPCR = 99.7% versus the ideal 99.61% (a 0.09% difference), and UACI = 29.3% versus the expected 33.46% (about a 10% difference). MAE of the encrypted image is about 35, versus about 23 for column permutation and about 27 for row and 2D permutation.
- Correlation coefficients of the encrypted image (horizontal 0.005, vertical 0.011, diagonal 0.023, average 0.013) are lower than those reported for four comparison methods (averages 0.015–0.042); the paper states individual, average, and RMS values were lower than previous research by a factor between 13% and 70%.
- Key space is 2^218 ≈ 4.12 × 10^65, from Key-P (90 bits) plus Key-S (128 bits), which the authors state is large enough to resist brute-force attacks.
Methods
- Design: a two-unit encryption system — chaotic pixel permutation (logistic random bit sequence generator → pseudorandom number calculator → Tompkins-Paige algorithm, applied as 1D row/column and 2D row-and-column permutation) followed by chaotic pixel substitution (tent pseudorandom image generator plus modulo-256 addition).
- Data and parameters: a 128×128 Lena image with 256 gray scales; L = 128 pixels permuted, 127 integer pseudorandom numbers and 768 bits generated; Key-P is 90 bits (26-bit initial value, 64-bit control parameter) and Key-S is 128 bits (64-bit initial value, 64-bit control parameter); 16,384 tent-map iterations produce the 128×128 pseudorandom image.
- Analysis: MATLAB simulation, with security assessed by chi-square histogram test, horizontal/vertical/diagonal correlation coefficients (about a thousand randomly selected adjacent pixel pairs), MAE, NPCR, UACI, and key-space size, compared against four prior methods.
Limitations
- The paper states that all security results were obtained in only one round of the encryption process, and notes that more than one iteration with different keys can be applied to improve security.
- The paper reports UACI of 29.3% against an expected 33.46%, acknowledging a difference of about 10% from the expected value — a weaker result than the NPCR claim.
- Evident from the text: the abstract states NPCR is "exactly the ideal value," but the reported value is 99.7% versus the ideal 99.61%; and all simulations use a single 128×128 Lena test image, so generalization to other images or sizes is not demonstrated.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
1 Valid · 7 Not valid · 9 Not checked · 27 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“With respect to the speed of the today's computers, the key space size should be more than 2 100 10 30 in order to avoid brute-force attacks 33 .”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 5.4. Key Space Analysis
What the sources say
- Supportedcites [33] 33. G. Alvarez and S. Li, "Some basic cryptographic requirements for chaos-based cryptosystems," International Journal of Bifurcation and Chaos, vol. 16, no. 8, pp. 2129-2151, 2006. source
Section 4.4 (p. 10) explicitly states in Rule 13 that the key space should exceed 2^100 to prevent brute-force attacks. The same passage gives 2^100 ≃ 10^30 and relates the threshold to contemporary computer speed. (LLM, conf=0.95)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The histogram is approximated by a uniform distribution.”
- Also stated in: § 4. Simulation of the Chaotic Image Encryption System · boosted
“The final histogram clearly appears uniform.”
- Also stated in: § 6. Conclusion · plain
“The histogram of the encrypted image was approximated a uniform distribution.”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 5.1. Histogram
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § 4. Simulation of the Chaotic Image Encryption System · boosted
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Satisfactory security performance of the proposed system is achieved in only one round and therefore the total encryption time is short .”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 1. Introduction
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In a different permutation approach, the pixels of all rows are first rearranged, with respect to the first permutation matrix/vector and the pixels of all columns are then rearranged, with respect to the second permutation matrix/vector.The encrypted images that appear as a random noisy image are also shown in Section 4.”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 3.1.5. 2D Chaotic Pixel Permutation
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“NPCR of our proposed system is exactly the ideal value of this criterion.”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > Abstract
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
22 more claims
Create a free account to see all 44 claims and every source verdict.
- Borderline: one of the tests for a substantial claim is unclear. 2
- It may state two separate claims as one. 10
- Probably not a substantial claim. 7
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > Abstract
“NPCR of our proposed system is exactly the ideal value of this criterion.”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 5.7
“Considering two Pseudorandom images, the expected value of NPCR is found to be 99.61%.The proposed method is evaluated using this criterion and NPCR of Figure 13 is 99.7%.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 5.3
“the correlation coefficients of the proposed encrypted image Figure 13 in all three directions are smaller than the correlation coefficients of the proposed permuted image Figure 7”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 6. Conclusion
“Figure: 7 Figure 7 : Figure 7: 128 × 128 Lena image with 256 gray scales and its image histogram.”
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > Additional information
“The individual values and their average and RMS values of correlation coefficients were lower than the corresponding values from previous research by a factor between 13% to 70%.”
§ Chaotic Image Encryption Design Using Tompkins-Paige Algorithm > 6. Conclusion
“| Diagonal D | 0.021 | 0.005 | 0.032 | 0.007 | 0.023 |”
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
Cryptography: Theory and Practice
Stinson, D. R. (1995) · Cited by 2,743
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 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
Chaos: An Introduction to Dynamical Systems
Alligood, K. T., Sauer, T. D., Yorke, J. A., & Crawford, J. D. (1997) · Physics Today · doi:10.1063/1.882006 · Cited by 1,469
Image encryption using chaotic logistic map
Pareek, N. K., Patidar, V., & Sud, K. K. (2006) · Image and Vision Computing · doi:10.1016/j.imavis.2006.02.021 · Cited by 1,261
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
A NOVEL FAST IMAGE ENCRYPTION SCHEME BASED ON 3D CHAOTIC BAKER MAPS
MAO, Y., CHEN, G., & LIAN, S. (2004) · International Journal of Bifurcation and Chaos · doi:10.1142/s021812740401151x · Cited by 611
A new chaotic algorithm for image encryption
Gao, H., Zhang, Y., Liang, S., & Li, D. (2006) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.08.110 · Cited by 512
Chaos: An Introduction to Dynamical Systems
Alligood, K. T., Sauer, T. D., & Yorke, J. A. (1997) · Textbooks in Mathematical Sciences · doi:10.1007/978-3-642-59281-2 · Cited by 451
Research works printed but not linked: 3
- 15. S. E. Borujeni and A. Zakerolhoseini, "Permutation based image encryption using pseudo random number generator and Tompkins-Paige algorithm," in Proceedings of the International Conference on Robotics, Vision, Information and Signal Processing, pp. 478-481, Penang, Malaysia, 2007.
- 31. S. E. Borujeni and M. Eshghi, "Design and simulation of encryption system based on PRNG and Tompkins-Paige permutation algorithm using VHDL," in Proceedings of the International Conference on Robotics, Vision, Information and Signal Processing, pp. 63-67, Penang, Malaysia, 2007.
- 32. F. Zhou, G. Cao, and B. Li, "Design of digital image encryption algorithm based on compound chaotic system," Journal of Harbin Institute of Technology, vol. 14, supplement 2, pp. 30-33, 2007.
Cited by
A chaos-based digital image encryption scheme with an improved diffusion strategy
Fu, C., Chen, J.-J., Zou, H., Meng, W.-H., Zhan, Y.-F., & Yu, Y.-W. (2012) · Optics Express · doi:10.1364/oe.20.002363 · Cited by 272
Norouzi, B., Mirzakuchaki, S., Seyedzadeh, S. M., & Mosavi, M. R. (2014) · Multimedia Tools and Applications · doi:10.1007/s11042-012-1292-9 · Cited by 215
“These measures consist of key space analysis, information entropy analysis, statistical analysis, and sensibility analysis [1, 6, 9, 10, 13, 21, 22, 30, 32, 33, 36, 37, 42, 43, 46, 50].”
MethodImage encryption algorithm using chaotic Chebyshev generator
Huang, X. (2012) · Nonlinear Dynamics · doi:10.1007/s11071-011-0155-7 · Cited by 188
“The NPCR and UACI [14, 22 , 26] defined as follows”
MethodRGB Image Encryption through Cellular Automata, S-Box and the Lorenz System
Alexan, W., ElBeltagy, M., & Aboshousha, A. (2022) · Symmetry · doi:10.3390/sym14030443 · Cited by 187
An efficient and secure medical image protection scheme based on chaotic maps
Fu, C., Meng, W.-H., Zhan, Y.-F., Zhu, Z.-L., Lau, F. C. M., Tse, C. K., & Ma, H.-F. (2013) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2013.05.005 · Cited by 179
Younas, I., & Khan, M. (2018) · Entropy · doi:10.3390/e20120913 · Cited by 121
Image Encryption Using Random Bit Sequence Based on Chaotic Maps
Khanzadi, H., Eshghi, M., & Borujeni, S. E. (2013) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-013-0713-z · Cited by 106
“The unified average changing intensity (UACI) measures the average intensity of differences between the plain image and ciphered image [2,9].”
BackgroundMethodInfluentialSelf-citationLogeshwari, R., & Parvathy, L. R. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-08957-9 · Cited by 87
“In the literature [3], proposed permutation and substitution of pixels using the Tompkins-paige algorithm and chaotic maps.”
MethodChaotic image encryption system using phase-magnitude transformation and pixel substitution
Borujeni, S. E., & Eshghi, M. (2011) · Telecommunication Systems · doi:10.1007/s11235-011-9458-8 · Cited by 86
“Correlation coefficients of pixels in the encrypted image should be as low as possible to protect the encryption system against statistical attacks [10].”
BackgroundMethodSelf-citationA novel image encryption scheme based on quantum dynamical spinning and rotations
Khan, M., & Waseem, H. M. (2018) · PLOS ONE · doi:10.1371/journal.pone.0206460 · Cited by 73
RetractedImage Encryption Using Chaos and Block Cipher
Jolfaei, A., & Mirghadri, A. (2010) · Computer and Information Science · doi:10.5539/cis.v4n1p172 · Cited by 73
“So, a remarkable number of chaotic systems, both physical and mathematical, were designed for realizing encryption and decryption of messages in both hardware and software equipments (Patidar, Pareek & Sud, 2009) (Etemadi Borujeni & Eshghi, 2009) (XiaoJun & MingGen, 2010).”
BackgroundDiaconu, A.-V., & Loukhaoukha, K. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/848392 · Cited by 74
“, close to unity, at least for NPCR), while UACI values must be around 33% [1, 2, 5, 7].”
BackgroundUniversal Chosen-Ciphertext Attack for a Family of Image Encryption Schemes
Chen, J., Chen, L., & Zhou, Y. (2020) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2020.3011315 · Cited by 70
“In literature, there are many ciphers of this kind, such as the ones in [12]–[14], [16], [22], [39]–[42] which all fall into the scope of this work.”
BackgroundInfluentialRavikumar, S., & Dhanushkodi, K. (2020) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-020-02424-x · Cited by 77
RetractedKhan, M., & Munir, N. (2019) · Wireless Personal Communications · doi:10.1007/s11277-019-06594-6 · Cited by 58
“[17] 0.00500 0.01100 0.02300 Ref.”
InfluentialRetractedA Symmetric Chaos-Based Image Cipher with an Improved Bit-Level Permutation Strategy
Fu, C., Huang, J.-B., Wang, N., Hou, Q.-B., & Lei, W. (2014) · Entropy · doi:10.3390/e16020770 · Cited by 55
Altaleb, A., Saeed, M. S., Hussain, I., & Aslam, M. (2017) · AIP Advances · doi:10.1063/1.4978264 · Cited by 56
A novel chaotic image cryptosystem based on DNA sequence operations and single neuron model
Ben Slimane, N., Aouf, N., Bouallegue, K., & Machhout, M. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6145-8 · Cited by 51
“, require reliable, fast, and robust security system to store and transmit digital images [4, 22, 34, 51].”
BackgroundA new approach to digital content privacy using quantum spin and finite-state machine
Waseem, H. M., & Khan, M. (2019) · Applied Physics B · doi:10.1007/s00340-019-7142-y · Cited by 47
Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map
Stoyanov, B. P., & Kordov, K. (2014) · The Scientific World JOURNAL · doi:10.1155/2014/283639 · Cited by 49
“In [10], a new permutation-substitution image encryption scheme using logistic, tent maps, and Tompkins-Paige algorithm is proposed.”
MethodWu, J., Shi, J., & Li, T. (2019) · Entropy · doi:10.3390/e22010005 · Cited by 47
“Borujeni and Eshghi used a logistic map to generate a bit sequence for pseudorandom number generation in Tompinks–Paige algorithm, and the results indicated that the proposed scheme could resist any brute-force and statistical attacks [7].”
MethodA Novel Chaos-based Image Encryption Scheme with an Improved Permutation Process
Ma, X., Fu, C., Lei, W., & -, S. L. (2011) · International Journal of Advancements in Computing Technology · doi:10.4156/ijact.vol3.issue5.26 · Cited by 39
“Recently, there have been many papers on chaos-based image cryptosystem [1-21].”
BackgroundCryptographic algorithm based on pixel shuffling and dynamical chaotic economic map
Askar, S., Karawia, A. A., & Alammar, F. S. (2017) · IET Image Processing · doi:10.1049/iet-ipr.2016.0906 · Cited by 41
Xu, J., Li, P., Yang, F., & Yan, H. (2019) · IEEE Access · doi:10.1109/access.2019.2952140 · Cited by 40
An encryption scheme based on chaotic Rabinovich-Fabrikant system and S8 confusion component
Alghafis, A., Munir, N., & Khan, M. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-10142-x · Cited by 39
“[12] 0.01200 0.02700 0.00700 Ref.”
InfluentialSecurity of Multi-frame DICOM Images Using XOR Encryption Approach
Natsheh, Q., Li, B., & Gale, A. G. (2016) · Procedia Computer Science · doi:10.1016/j.procs.2016.07.018 · Cited by 36
“If the correlation factor for the completely different images is very close to zero then this is an efficiency indicator of the encryption algorithm, but if the factor is equal to one, this indicates that the original and encrypted images are identical, and so indicates inefficiency 19 .”
BackgroundImage Encryption using Block Based Uniform Scrambling and Chaotic Logistic Mapping
Rakesh, S. (2012) · International Journal on Cryptography and Information Security · doi:10.5121/ijcis.2012.2105 · Cited by 33
Image encryption based on Fisher‐Yates shuffling and three dimensional chaotic economic map
Karawia, A. A. (2019) · IET Image Processing · doi:10.1049/iet-ipr.2018.5142 · Cited by 34
Chaotic image encryption algorithm based on pseudo-random bit sequence and DNA plane
Wang, X., Zhao, H., Hou, Y., Luo, C., Zhang, Y., & Wang, C. (2019) · Modern Physics Letters B · doi:10.1142/s0217984919502634 · Cited by 35
Arshad, U., Khan, M., Shaukat, S., Amin, M., & Shah, T. (2019) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2019.123458 · Cited by 30
CVC: Chaotic visual cryptography to enhance steganography
Mostaghim, M., & Boostani, R. (2014) · International ISC Conference on Information Security and Cryptology (ISCISC) · doi:10.1109/iscisc.2014.6994020 · Cited by 21
“Regarding the speed of today’s computers, the key space size should be more than 2(100) = 10(30) in order to avoid brute-force attacks [24, 25].”
BackgroundDiaconu, A.-V., Costea, A., & Costea, M.-A. (2014) · Mathematical Problems in Engineering · doi:10.1155/2014/932875 · Cited by 24
“On the contrary, in cases of scrambled images, those values are close to zero, meaning that all neighboring pixels considered in tests are weakly correlated, which is the expected result [5, 46, 47].”
BackgroundImage encryption based on gyrator transform using chaotic maps
Khanzadi, H., Omam, M. A., Lotfifar, F., & Eshghi, M. (2010) · International Conference on Signal Processing · doi:10.1109/icosp.2010.5656132 · Cited by 19
“Many applications like military image databases, confidential video conferencing, medical imaging system, online personal photograph album, etc., require reliable, fast and robust security system to store and transmit digital images [1] [2].”
BackgroundSelf-citationSegmentation based encryption method for medical images
Mahmood, A. B., & Dony, R. D. (2011) · International Conference for Internet Technology and Secured Transactions · Cited by 17
Kumar, G. A. S., Bagan, K. B., & Vivekanand, V. (2011) · Procedia Computer Science · doi:10.1016/j.procs.2010.12.064 · Cited by 17
Chaotic cryptographic scheme and its randomness evaluation
Stoyanov, B. P. (2012) · AIP conference proceedings · doi:10.1063/1.4758983 · Cited by 15
An Enhanced Chaotic Image Encryption
Philip, M. (2011) · International Journal of Computer Science Engineering and Information Technology · doi:10.5121/ijcseit.2011.1507 · Cited by 15
Securing color images using Two-square cipher associated with Arnold map
Kumar, S. U., & Sharma, R. K. (2016) · Multimedia Tools and Applications · doi:10.1007/s11042-016-3504-1 · Cited by 16
“…gyrator, affine, arnold transforms, and the chaotic maps etc. are some of the common primitives used to determine the image encryption methods [1, 3, 5–19, In [5, 12, 15, 21, 23, 24], the image encoding and decoding methods are presented based on Arnold map associated with other different…”
MethodImage encryption using HC-128 and HC-256 stream ciphers
Jolfaei, A., Vizandan, A., & Mirghadri, A. (2012) · International Journal of Electronic Security and Digital Forensics · doi:10.1504/ijesdf.2012.045388 · Cited by 13
New extension of data encryption standard over 128-bit key for digital images
Arshad, S., & Khan, M. (2021) · Neural Computing and Applications · doi:10.1007/s00521-021-06023-5 · Cited by 13
Automatic Selective Encryption of DICOM Images
Natsheh, Q., Sălăgean, A., Zhou, D., et al. (2023) · Applied Sciences · doi:10.3390/app13084779 · Cited by 12
Sathishkumar, G. A., & Bagan, K. B. (2011) · doi:10.5555/2001192.2001193 · Cited by 13
Design and Analysis of New Shuffle Encryption Schemes for Multimedia
Gupta, R., Aggarwal, A., & Pal, S. K. (2012) · Defence Science Journal · doi:10.14429/dsj.62.1008 · Cited by 11
Efficient Chaotic Permutations for Image Encryption Algorithms
Awad, A., & Saadane, A. (2010) · Cited by 11
Image Encryption Using Chaotic Maps in Hybrid Domain
Dr.S.Ramahrishnan, R.Geetha, B. E., head, P. V. P., UG Scholars Department of Information Technology, & Dr.Mahalingam College of Engineering and Technology (2019) · International Journal of communication and computer Technologies · doi:10.31838/ijccts/02.02.01 · Cited by 11
“ShahramEtemadi Borujeni1, and Mohammad Eshghi, Chaotic image encryption design using TompkinsPaige algorithm.[3] Suggested image encryption using Tompkins-Paige algorithm in time domain .”
MethodSelective Video Encryption Using the Cross Coupling of One-dimensional Logistic Maps
Malladar, R. S., & Kunte, R. S. (2021) · International Journal of Computer Network and Information Security · doi:10.5815/ijcnis.2021.05.04 · Cited by 8
An Algorithm for Data Hiding in Radiographic Images and ePHI/R Application
Rashid, A., Salamat, N., & Prasath, V. B. S. (2018) · Technologies · doi:10.3390/technologies6010007 · Cited by 8
Image Encryption Based on Chaotic Tent Map in Time and Frequency Domains
Hassani, E., & Eshghi, M. (2013) · Isecure. · doi:10.22042/isecure.2013.5.1.7 · Cited by 7
Self-citationImage Encryption Method Using Dependable Multiple Chaotic Logistic Functions
Gupta, R., Pachauri, R., & Singh, A. K. (2019) · International Journal of Information Security and Privacy · doi:10.4018/ijisp.2019100104 · Cited by 6
Survey and Analysis of Chaotic Image Encryption Schemes
Rajput, A. S., & Sharma, V. (2015) · International Journal of Communication Systems and Network Technologies · doi:10.14257/ajmahs.2015.10.39 · Cited by 6
“Total key space is 2 2 , 160 , which is large enough to resist any bruteforce attack [13] .”
Enhanced Cryptography by Multiple Chaotic Dynamics
Chen, J., Zhou, J., Wong, K., & Ji, Z. (2011) · Mathematical Problems in Engineering · doi:10.1155/2011/938454 · Cited by 5
Multilevel Image EncryptionPreprint
Rakesh, S., Kaller, A. A., Shadakshari, B. C., et al. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1202.4871 · Cited by 5
Kamatchi, A., & Arulprakasam, R. (2026) · Nonlinear Dynamics · doi:10.1007/s11071-026-12262-9 · Cited by 5
Multi-Size Image Encryption Algorithm Based on Fractional-Order Cellular Neural Network
Cao, Y., Liu, Y., Wang, K., Xu, X., & Lu, J. (2024) · IEEE Access · doi:10.1109/access.2024.3476347 · Cited by 4
“At the same time, compared with the existing encryption methods such as AES and DES [4], [5], the encryption scheme introduced by chaos theory can effectively provide more secure protection according to the characteristics of image information.”
MethodCryptanalysis of an Enhanced Spatiotemporal Chaotic Image/Video Cryptosystem
Yoon, E., Hong, J.-W., Yoon, S.-Y., Park, D.-I., & Choi, M. (2011) · EURASIP Journal on Advances in Signal Processing · doi:10.1155/2011/461563 · Cited by 4
“Therefore, it can provide a fast and secure methods for data protection, which is crucial for multimedia data transmission over fast communication channels, such as the broadband internet communication [5–9].”
MethodMining collaborative spatio-temporal clues for face forgery detection
Ding, B. Y., Fan, Z., Zhao, Z., & Xia, S. (2023) · Multimedia Tools and Applications · doi:10.1007/s11042-023-16173-4 · Cited by 7
An Image Encryption Technique based on DNA Encoding and Round-reduced AES Block Cipher
Shehab, E., Farag, A. K., & Keshk, A. E.-S. (2014) · International Journal of Computer Applications · doi:10.5120/18864-0543 · Cited by 6
Mehran, N., & Khayyambashi, M. R. (2017) · International Journal of Computer Network and Information Security · doi:10.5815/ijcnis.2017.09.04 · Cited by 4
“Correlation Coefficient determines the degree of similarity and the dependence between two adjacent variables in a certain direction [21].”
BackgroundAnalysis of Color Image Encryption Using Multidimensional Bogdanov Map
Parida, R. N. R., Singh, S., & Pradhan, C. (2020) · IGI Global eBooks · doi:10.4018/978-1-7998-7705-9.ch063 · Cited by 5
Pauli Half Spinning and Elliptic Curve Based Information Confidentiality Mechanism
Arshad, S., Khan, M., & Hussain, I. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04900-2 · Cited by 3
Chaotic & partial encrypted image on XOR bus - an unidentified carrier approach
Praveenkumar, P., Swathi, C., Thenmozhi, K., et al. (2016) · International Conference on Computer Communication and Informatics (ICCCI) · doi:10.1109/iccci.2016.7479993 · Cited by 3
Adaptive Approaches for Medical Imaging Security
Mahmood, A. (2015) · The Atrium (University of Guelph) · Cited by 4
Exploring a novel fusion-scheme based on mathematical equation system for encryption-image algorithm
Torres-Muñoz, D., Vázquez-Leal, H., & Hernández-Mejía, C. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09168-y · Cited by 2
Image Encryption Based on Jacobi Function
Rodriguez-Sahagun, M. T., Mercado-Sanchez, J. B., Lopez-Mancilla, D., Jaimes-Reátegui, R., & García-López, J. H. (2013) · International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE) · doi:10.1109/icmeae.2013.20 · Cited by 1
MEHRAB MAPS: ONE-DIMENSIONAL PIECEWISE NONLINEAR CHAOTIC MAPS
Borujeni, S. E., Eshghi, M., & Boroujeni, M. (2012) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127412501271 · Cited by 2
Self-citationA New Medical Images Encryption algorithm Based on Gold Code: Futures Trends Towards Telemedicine
Ellewe, M. H., Sagheer, A. M., & Abdulbaqi, A. S. (2020) · IOP Conference Series Materials Science and Engineering · doi:10.1088/1757-899x/928/3/032032 · Cited by 2
“The calculation of diagonal, vertical, and horizontal correlation coefficients (rxy) of two adjacent-pixels utilizing the following equation[14]: − Av(y)) (6) x and y indicates to the two adjacent-pixels of gray-scale values in the image, and Av indicates the average value that shown in the…”
BackgroundMethodA New Bluetooth Security Architecture
Philip, M., & Das, A. (2011) · Communications in computer and information science · doi:10.1007/978-3-642-24043-0_51 · Cited by 1
Chaotic Image Encryption using Modular Addition and Combinatorial Techniques
Sathishkumar, G. A., Bagank, B., & Mastan, J. M. K. (2015) · The International Arab Journal of Information Technology · Cited by 1
Graceful labeling based En (Grace) cryption and De (Grace) cryption
Mithun, P., & Raajan, N. R. (2013) · IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology · doi:10.1109/ice-ccn.2013.6528567
Image permutation scheme based on modified Logistic mapping
Cao, G., Hu, K., & Ding, Y. (2012)
Gupta, R., Pachauri, R., & Singh, A. K. (2019) · Current Medical Imaging Formerly Current Medical Imaging Reviews · doi:10.2174/1573405615666190101110751
Universal chosen-ciphertext attack for a family of image encryption schemesPreprint
Chen, J., Chen, L., & Zhou, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.11987
“In literature, there are many ciphers of this kind, such as the ones in [12]–[14], [16], [22], [39]–[42] which all fall into the scope of this work.”
BackgroundInfluentialA New Efficient Approach Based On Chaotic Map For Image Encryption
HADOUDA, A., Trache, N., & Khelfi, M. F. (2020) · Malaysian Journal of Computing and Applied Mathematics · doi:10.37231/myjcam.2020.3.2.55
“…intensity of differences between the plain image and ciphered image, The NPCR and UACI of these two images are defined in equations (4), (5) [11,12]: where D(i,j) is defined as W and H are the width and height of encrypted image C 1 (i,j) and C 2 (i,j), are the pixel's value of the original…”
BackgroundImage Encryption Method Using Dependable Multiple Chaotic Logistic Functions
Gupta, R., Pachauri, R., & Singh, A. K. (2020) · IGI Global eBooks · doi:10.4018/978-1-7998-7705-9.ch034
Mining efficient protection scheme for light field 3D video security: A 3D to 2D method
Guo, J., Wang, H., Liu, S., Zhang, C., Zeng, H., Kim, S.-T., & Li, X. (2026) · Signal Processing · doi:10.1016/j.sigpro.2026.110555
Metadata
- Authors
- Etemadi Borujeni, S., & Eshghi, M.
- Affiliations
- Shahid Beheshti University (IR)
- ORCID
- Eshghi, Mohammad
- Venue
- Mathematical Problems in Engineering
- Publisher
- Wiley
- Published
- 2009-01
- Volume
- 2009
- Issue
- 1
- ISSN
- 1024-123X (ISSN-L)
- 1563-5147
- OpenAlex
- W2049395637
- Semantic Scholar
- ea5235e3a889d372b0c3fb7f323c08cfffb70a5e
- Cited by
- 74
- References
- 32
- Citations by year
- 2026: 2 · 2024: 1 · 2023: 2 · 2022: 1 · 2021: 3 · 2020: 9 · 2019: 10 · 2018: 4 · 2017: 3 · 2016: 3 · 2015: 3 · 2014: 5 · 2013: 6 · 2012: 9
- FWCI
- 8.09
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- Mathematical Problems in Engineering (publishedVersion, cc-by)
- RePEc: Research Papers in Economics (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- 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 › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Keywords
- image encryption, chaotic maps, logistic map, pixel permutation, pixel substitution, pseudorandom number generation, NPCR, UACI, key space, histogram uniformity, correlation coefficient
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.
A language model drew the claims from the paper on 2026-10-11, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-11 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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
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.