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
- BorujeniS. E.andZakerolhoseiniA. Permutation based image encryption using pseudo random number generator and Tompkins-Paige algorithm Proceedings of the International Conference on Robotics Vision Information and Signal Processing 2007 Penang Malaysia 478–481.
- BorujeniS. E.andEshghiM. Design and simulation of encryption system based on PRNG and Tompkins-Paige permutation algorithm using VHDL Proceedings of the International Conference on Robotics Vision Information and Signal Processing 2007 Penang Malaysia 63–67.
- Zhou F., 2007, Design of digital image encryption algorithm based on compound chaotic system, Journal of Harbin Institute of Technology, 14, 30
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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Chaotic Image Encryption Design Using Tompkins-Paige Algorithm. https://app.cochat.ai/papers/10.1155/2009/762652
- The paper
- Etemadi Borujeni, S., & Eshghi, M. (2009). Chaotic Image Encryption Design Using Tompkins-Paige Algorithm. Mathematical Problems in Engineering. https://doi.org/10.1155/2009/762652
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.