CoChat

Chaotic Image Encryption Design Using Tompkins-Paige Algorithm

Open access
Etemadi Borujeni, Shahram, Eshghi, Mohammad · 2009 · Mathematical Problems in Engineering

The 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

Crossref · 10.1155/2009/762652

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

1 Valid · 7 Not valid · 9 Not checked · 27 Own results and interpretations

22 more claims

Create a free account to see all 44 claims and every source verdict.

See all claims — free account
  • 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

Create a free account to see these claims.

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.

3 of 3

Citations

Cites

Show all 35 references

Research works printed but not linked: 3

  1. 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.
  2. 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.
  3. Zhou F., 2007, Design of digital image encryption algorithm based on compound chaotic system, Journal of Harbin Institute of Technology, 14, 30

Cited by

See all 75

Metadata

Authors
Etemadi Borujeni, S., & Eshghi, M.
Affiliations
Shahid Beheshti University (IR)
Venue
Mathematical Problems in Engineering
Publisher
Wiley
Published
2009-01
Volume
2009
Issue
1
ISSN
  • 1024-123X (ISSN-L)
  • 1563-5147
OpenAlex
W2049395637
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
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.