Cited by 125Chaos-based Image/Signal EncryptionComputer Science and EngineeringAdvanced Steganography and Watermarking Techniques

A Novel Hybrid Secure Image Encryption Based on Julia Set of Fractals and 3D Lorenz Chaotic Map

Open access
Masood, Fawad, Ahmad, Jawad, Shah, Syed Aziz, Jamal, Sajjad Shaukat, Hussain, Iqtadar·2020·Entropy

Abstract

Chaos-based encryption schemes have attracted many researchers around the world in the digital image security domain. Digital images can be secured using existing chaotic maps, multiple chaotic maps, and several other hybrid dynamic systems that enhance the non-linearity of digital images. The combined property of confusion and diffusion was introduced by Claude Shannon which can be employed for digital image security. In this paper, we proposed a novel system that is computationally less expensive and provided a higher level of security. The system is based on a shuffling process with fractals key along with three-dimensional Lorenz chaotic map. The shuffling process added the confusion property and the pixels of the standard image is shuffled. Three-dimensional Lorenz chaotic map is used for a diffusion process which distorted all pixels of the image. In the statistical security test, means square error (MSE) evaluated error value was greater than the average value of 10000 for all standard images. The value of peak signal to noise (PSNR) was 7.69(dB) for the test image. Moreover, the calculated correlation coefficient values for each direction of the encrypted images was less than zero with a number of pixel change rate (NPCR) higher than 99%. During the security test, the entropy values were more than 7.9 for each grey channel which is almost equal to the ideal value of 8 for an 8-bit system. Numerous security tests and low computational complexity tests validate the security, robustness, and real-time implementation of the presented scheme.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e22030274

Cites

83 of 83 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • The execution time of SCEC is 0.2 s, compared to 1.708 s, 4.750 s, 4.828 s, and 3.253 s for Refs [32], [33], [34], and [35], respectively.

    “Ref. [32] Ref. [33] Ref. [34] Ref. [35] Time (s) 0.2 1.708 4.750 4.828 3.253”

    From Cryptosystem Based on the Elliptic Curve With a High Degree of Resistance to Damage on the Encrypted Images (2020) · cites this paper as [32]

    Section 6.8 (Time Complexity; page unavailable) says the authors measured their encryption scheme’s execution time and refers to Table 12, but the passages in our copy do not give the claimed 1.708 s value or the comparison times. Searches for 1.708, SCEC, and the listed times found no passage establishing those numbers. (LLM, conf=0.72)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

5 retracted

Flagged first, then by citations

2 of the 85 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. [13]Belkhouche F. Qidwai U. Binary image encoding using 1D chaotic maps Proceedings of the Annual Technical Conference IEEE Region 5 New Orleans, LA, USA 11 April 2003
  2. [15]Habutsu T. Nishio Y. Sasase I. Mori S. A secret key cryptosystem by iterating a chaotic map Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK 8–11 April 1991
  3. [44]Stallings W. Cryptography and Network Security 4th ed. McGraw-Hill, Inc. New York, NY, USA 2007

Cited by

Sorted by citations

Authors
Masood, F., Ahmad, J., Shah, S. A., Jamal, S. S., & Hussain, I.
Affiliations
  • Institute of Space Technology (PK)
  • Edinburgh Napier University (GB)
  • Manchester Metropolitan University (GB)
  • King Khalid University (SA)
  • Qatar University (QA)
Corresponding author
Shah, Syed Aziz
Venue
Entropy
Publisher
MDPI AG
Published
2020-02-28
Volume
22
Issue
3
Pages
274
ISSN
1099-4300 (ISSN-L)
OpenAlex
W3008319366
Cited by
125
References
85
Citations by year
2026: 3 · 2025: 8 · 2024: 16 · 2023: 21 · 2022: 34 · 2021: 27 · 2020: 16
FWCI
9.52
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Edinburgh Napier Research Repository (Edinburgh Napier University) (publishedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Research Output (Edinburgh Napier University) (submittedVersion, cc-by)
  • Qatar University QSpace (Qatar University) (submittedVersion)
Funders
Deanship of Scientific research at King Khalid University (R.G.P 2/58/40)
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, chaos-based cryptography, Julia sets, confusion and diffusion, pixel shuffling, hybrid chaotic maps, NPCR, entropy analysis

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