CoChat
Sign Up
Cited by 25Chaos-based Image/Signal EncryptionComputer Science and EngineeringAdvanced Steganography and Watermarking Techniques

Enhancing image security via chaotic maps, Fibonacci, Tribonacci transformations, and DWT diffusion: a robust data encryption approach

Open access
Hazzazi, Mohammad Mazyad, Rehman, Mujeeb Ur, Shafique, Arslan, Aljaedi, Amer, Bassfar, Zaid, Usman, Aminu Bello·2024·Scientific Reports
DOI 10.1038/s41598-024-62260-3PMC PMC11637051
Open this paper in CoChat — free accountOpen PDF

Abstract

In recent years, numerous image encryption schemes have been developed that demonstrate different levels of effectiveness in terms of robust security and real-time applications. While a few of them outperform in terms of robust security, others perform well for real-time applications where less processing time is required. Balancing these two aspects poses a challenge, aiming to achieve efficient encryption without compromising security. To address this challenge, the proposed research presents a robust data security approach for encrypting grayscale images, comprising five key phases. The first and second phases of the proposed encryption framework are dedicated to the generation of secret keys and the confusion stage, respectively. While the level-1, level-2, and level-2 diffusions are performed in phases 3, 4, and 5, respectively, The proposed approach begins with secret key generation using chaotic maps for the initial pixel scrambling in the plaintext image, followed by employing the Fibonacci Transformation (FT) for an additional layer of pixel shuffling. To enhance security, Tribonacci Transformation (TT) creates level-1 diffusion in the permuted image. Level-2 diffusion is introduced to further strengthen the diffusion within the plaintext image, which is achieved by decomposing the diffused image into eight-bit planes and implementing XOR operations with corresponding bit planes that are extracted from the key image. After that, the discrete wavelet transform (DWT) is employed to develop secondary keys. The DWT frequency sub-band (high-frequency sub-band) is substituted using the substitution box process. This creates further diffusion (level 3 diffusion) to make it difficult for an attacker to recover the plaintext image from an encrypted image. Several statistical tests, including mean square error analysis, histogram variance analysis, entropy assessment, peak signal-to-noise ratio evaluation, correlation analysis, key space evaluation, and key sensitivity analysis, demonstrate the effectiveness of the proposed work. The proposed encryption framework achieves significant statistical values, with entropy, correlation, energy, and histogram variance values standing at 7.999, 0.0001, 0.0156, and 6458, respectively. These results contribute to its robustness against cyberattacks. Moreover, the processing time of the proposed encryption framework is less than one second, which makes it more suitable for real-world applications. A detailed comparative analysis with the existing methods based on chaos, DWT, Tribonacci transformation (TT), and Fibonacci transformation (FT) reveals that the proposed encryption scheme outperforms the existing ones.

AI snapshot

Written from the paper’s full text.

TL;DR

The paper proposes a five-phase grayscale image encryption framework combining chaotic maps, Fibonacci and Tribonacci transforms, bit-plane XOR diffusion, and DWT/S-box diffusion. It reports strong statistical security and sub-second encryption times, outperforming compared schemes.

Key findings

  • The proposed scheme achieved entropy values of 7.9990–7.9995 across tested 256×256 and 512×512 images (Table 7); the abstract summarizes entropy, correlation, energy, and histogram variance as 7.999, 0.0001, 0.0156, and 6458, respectively.
  • Correlation values in Table 8 were low, e.g. 0.0001 for Einstein and Baboon, −0.0001 for Tree, and −0.0003 for Cameraman; proposed histogram variance values ranged from 259.596 to 266.677, compared with roughly 265–280 for prior schemes (Table 5).
  • Encryption and decryption completed in less than one second: 256×256 images took 0.0020–0.0021 s to encrypt and 0.0021–0.0022 s to decrypt; 512×512 images took 0.0040–0.0041 s to encrypt and 0.0042–0.0043 s to decrypt (Table 4).
  • Under 2% salt-and-pepper noise and 1/6 clipping, the proposed framework recovered 97.8% and 96.8% of the plaintext, versus 97.4% and 96.3% for the compared scheme in ref. 72 (Table 9).

Methods

  • Five-phase design: secret key generation using chaotic maps; confusion via Fibonacci transform (CAi); level-1 diffusion via Tribonacci transform; level-2 diffusion via bit-plane extraction and XOR with a key image; level-3 diffusion via Haar DWT decomposition and S-box substitution on the LL4 sub-band. A 256-bit key size is used.
  • Data: grayscale images of sizes 256×256 and 512×512, described as randomly sourced from Google; a chest X-ray image is used for noise and clipping attack comparison.
  • Analysis: statistical tests including mean square error, histogram variance, entropy, peak signal-to-noise ratio, correlation, key space, key sensitivity, computational time, and noise/clipping attacks, with comparisons to existing chaos-, DWT-, Tribonacci-, and Fibonacci-based schemes.

Limitations

  • The paper states future work may explore cloud/multimedia and real-time image transmission, optimize color image encryption, and integrate additional advanced encryption algorithms.
  • Evident from the text: experiments are limited to grayscale images, and color image encryption is left as future work; test images are “randomly sourced from Google” and limited to 256×256 and 512×512 sizes.
  • Evident from the text: key space and key sensitivity are claimed as evaluated, but no numeric results are provided; the abstract reports histogram variance 6458 while Table 5 reports proposed values of 259.596–266.677, an inconsistency.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41598-024-62260-3

Cites

73 of 73 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 11 cited sources checked · 0 supported · 0 flagged

  • Findingreasoning

    The execution times for encryption and decryption processes are approximately equal.

    “Moreover, it is evident that the execution times for encryption and decryption processes are approximately equal.”
    Quote in the paperNot a substantial claim
  • Findingown data

    The proposed encryption framework achieves an entropy value of 7.999.

    “The proposed encryption framework achieves significant statistical values, with entropy, correlation, energy, and histogram variance values standing at 7.999, 0.0001, 0.0156, and 6458, respectively.”
    Quote in the paperSubstantial claim
  • Findingown data

    The proposed encryption scheme achieves entropy values closer to 8 than the existing encryption schemes.

    “Table 7 indicates that the entropy values associated with the proposed encryption scheme exhibit a significant proximity to the value of 8. Furthermore, the existing encryption scheme also attains entropy values near eight, though these values remain slightly lower than those achieved by the proposed encryption scheme.”
    Quote in the paperSubstantial claim
  • Findingown data

    Several statistical tests demonstrate the effectiveness of the proposed work.

    “Several statistical tests, including mean square error analysis, histogram variance analysis, entropy assessment, peak signal-to-noise ratio evaluation, correlation analysis, key space evaluation, and key sensitivity analysis, demonstrate the effectiveness of the proposed work.”
    Quote in the paperSubstantial claim
  • Findingnone given

    The proposed method can handle different categories of images, such as binary images and images with different levels of grayscale.

    “Moreover, the proposed method demonstrates the ability to handle different categories of images, such as binary images and images with different levels of grayscale.”
    Quote in the paperNot a substantial claim
  • May combine two claims. 16
  • The quote only partly states this claim. 1
  • Classified as probably not a substantial claim. 19

  • May combine two claims.

    Findingown data

    After decryption of the noisy encrypted image, the plaintext content can be clearly visualized although exact pixel values are not restored.

    “The decryption outcomes are depicted in Fig. 10e,f, where it can be seen that although the exact pixel values are not restored, the content of the plaintext can be clearly visualized.”
    Quote in the paperSubstantial claim

  • May combine two claims. The quote only partly states this claim.

    Findingown data

    The percentage information in bit-planes follows Table 3, with B8 having 50.196% and decreasing by half for lower bit-planes.

    “The percentage content within each bit-plane can be computed using Eq. (19), and the resultant numerical values are displayed in Table 3.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Findingown data

    The ciphertext images produced by the proposed encryption method show no visible original plaintext image information, demonstrating the scheme successfully conceals plaintext information.

    “Upon examination of the figure, it becomes evident that there is no original plaintext image information is visible in the ciphertext images. This observation shows the efficacy of the proposed encryption scheme in successfully concealing the plaintext information.”
    Quote in the paperSubstantial claim

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    In the 3×3 example, the transformed matrix Pim′ is entirely different from the original matrix I.

    “From the matrix Pim′, it can be seen that this is entirely different from the original matrix I.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Findingown data

    The first four bit-planes (B8, B7, B6, B5) contain the maximum information, while the second four bit-planes (B4, B3, B2, B1) contain the minimum information.

    “The extracted Bi can exhibit variations in the quantity of information they contain. For instance, the set of the first four bit-planes (B8,B7,B6,B5) has the maximum information, while the group of the second four bit-planes (B4,B3,B2,B1) holds the minimum information, as illustrated in Fig. 4.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Findingown data

    Most current schemes exhibit weak security vulnerabilities, high computational complexity, or infeasibility for real-world implementations.

    “As indicated in Table 1, most current schemes exhibit weak security vulnerabilities, high computational complexity, or infeasibility for real-world implementations.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Interpretationreasoning

    The XOR and Tribonacci transform operations modify pixel intensities sufficiently to scramble them and prevent meaningful predictions about the original image from intensity profiles.

    “These dual operations effectively modify the intensity values of the pixels in I^c(a^(′),b^(′)), ensuring that the pixel intensities become sufficiently scrambled. This process bolsters the security of the data by preventing any meaningful predictions about the original image based on the intensity profiles of the I^c(a^(′),b^(′)) image.”
    Quote in the paperSubstantial claim

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationreasoning

    The high-key space enhances the security of digital data against brute-force attacks.

    “The high-key space enhances the security of the digital data against brute-force attacks.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based).

    Premisereasoning

    Traditional cryptographic schemes like DES and AES are not suitable for image encryption due to their high computational complexity.

    “Consequently, traditional cryptographic schemes like DES and AES are not suitable for image encryption due to their high computational complexity.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Interpretationown data

    The proposed encryption framework is more suitable for real-world applications because its processing time is less than one second.

    “Moreover, the processing time of the proposed encryption framework is less than one second, which makes it more suitable for real-world applications.”
    Quote in the paperSubstantial claim

  • May combine two claims.

    Premisecitation

    Pixel scrambling preserves the histogram of the original image because it does not alter pixel intensity.

    “In particular, this pixel scrambling process preserves the histogram of the original image since it does not alter the pixel intensity13.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [13] Long, M., Zhao, Y., Zhang, X. & Peng, F. A separable reversible data hiding scheme for encrypted images based on Tromino scrambling and adaptive pixel value ordering. Signal Process. 176, 107703 (2020). source

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    DWT is employed to generate secondary keys that enhance the security of the proposed encryption framework by diversifying the encryption keys.

    “DWT is employed to generate secondary keys that enhance the security of the propsoed encryption framework by diversifying the encryption keys.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S2 (checkable), S4 (based). May combine two claims.

    Premisereasoning

    Image encryption, when implemented effectively, secures against unauthorized access and ensures the confidentiality and integrity of visual data.

    “Image encryption, when implemented effectively, secures against unauthorized access and ensures the confidentiality and integrity of the visual data.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Premisenone given

    In images, the low-frequency sub-band typically contains the majority of plaintext information, while high-frequency sub-bands capture finer details such as edges.

    “In the context of images, the low-frequency sub-band typically contains the majority of the plaintext information, whereas the high-frequency sub-bands capture finer details, such as edges as shown in Fig. 5.”
    Quote in the paperNot a substantial claim

  • Classified as probably not a substantial claim.

    Premisecitation

    Entropy is used to assess the level of robustness in both plaintext and ciphertext images.

    “Entropy is used to assess the level of robustness in both plaintext and ciphertext images.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [26] Xiang, H. & Liu, L. An improved digital logistic map and its application in image encryption. Multimed. Tools Appl. 79, 30329–30355 (2020). source

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    Implementing the TBT by multiplying a Tribonacci array 3×3 with a vector 3×1 representing three consecutive pixels reduces overall computational time without compromising the strength of the security measures.

    “This optimization reduces overall computational time without compromising the strength of the security measures which makes the proposed encryption scheme suitable for real-world applications.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Interpretationreasoning

    A Tribonacci matrix M^i, regardless of index i, can convert data into an alternate domain, and the original data can be restored because M^i is invertible, so M^i can be integrated into encryption schemes.

    “Hence, based on the preceding discourse, it’s evident that a Tribonacci matrix Mⁱ, regardless of the specific index i, possesses the capability to convert data into an alternate domain. Moreover, it’s important to highlight that the original data can be restored, due to the invertibility of Mⁱ. Consequently, Mⁱ can be effectively integrated into encryption schemes.”
    Quote in the paperSubstantial claim

  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    Images with high texture can yield a higher maximum deviation.

    “However, images with high texture can yield a higher maximum deviation.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Interpretationreasoning

    The approximate equality of encryption and decryption times arises because decryption involves the same number of mathematical steps as encryption, but in reverse order, along with inversion of each step.

    “This consistency arises because the decryption process involves the same number of mathematical steps as encryption, but in reverse order, along with the inversion of each step.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Premisecitation

    In a plaintext image, there is typically a high correlation between pixel values, whereas in a ciphertext image there should be a lower correlation among pixels.

    “In a plaintext image, there is typically a high correlation between pixel values because the image content is readily visible. Conversely, in a ciphertext image where pixel content is concealed, there should be a lower correlation among the pixels.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [71] Khan, J. S. & Kayhan, S. K. Chaos and compressive sensing based novel image encryption scheme. J. Inf. Secur. Appl. 58, 102711 (2021). source

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    The level-2 diffusion step strengthens the diffusion within the plaintext image, making it more resistant against cryptographic attacks.

    “This step strengthens the diffusion within the plaintext image which makes it more resistant against cryptographic attacks.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Premisecitation

    Diffusion modifies the intensity values of pixels, leading to a uniform histogram in the cipher image and enhancing resilience against a spectrum of potential attacks.

    “This modification leads to the establishment of a uniform histogram in the cipher image, thereby enhancing the system’s resilience against a spectrum of potential attacks14.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [14] Wang, J., Geng, Y.-C., Han, L. & Liu, J.-Q. Quantum image encryption algorithm based on quantum key image. Int. J. Theor. Phys. 58, 308–322 (2019). source

  • May combine two claims.

    Interpretationcitation

    Using an S-box to create diffusion in a 32×32 frequency band takes very little time compared to using an S-box on a 256×256 image, because S-box diffusion on 256×256 takes approximately 20 seconds.

    “For example, to create diffusion in an image using a substitution box (S-box), a time of approximately 20 seconds will be taken to encrypt the image of size 256×25660. Therefore, creating diffusion using an S-box in a small frequency band having dimensions of 32×32 will take very little time compared to the time taken to create diffusion using an S-box in an image of size 256×256.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [60] Shafique, A. A new algorithm for the construction of substitution box by using chaotic map. Eur. Phys. J. Plus 135, 194 (2020). source

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    The nature of certain operations, such as XOR operations and DWT, allows for parallel processing that helps reduce the overall computational time.

    “The nature of certain operations, such as XOR operations and DWT, allows for parallel processing that helps reduce the overall computational time.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationnone given

    Any matrices corresponding to CAi, DOi, or CTi can be utilized as transformation matrices to scramble pixels.

    “It’s important to highlight that any matrices corresponding to CAi, DOi, or CTi can be utilized as transformation matrices to scramble the pixels.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    The proposed encryption framework is suitable for real-world applications where less processing time is a critical requirement.

    “The proposed encryption framework is suitable for real-world applications where less processing time is a critical requirement.”
    Quote in the paperNot a substantial claim

  • Classified as probably not a substantial claim.

    Study design and conductcitation

    The comparison of noise and clipping attack recovery uses the same plaintext image, a chest X-ray image, as the study in [72].

    “The comparison utilizes the same plaintext image, specifically a chest X-ray image, which is also used in the study presented in72.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [72] Singh, K. N., Singh, O., Singh, A. K. & Agrawal, A. K. EiMOL: A secure medical image encryption algorithm based on optimization and the Lorenz system. ACM Trans. Multimed. Comput. Commun. Appl. 19, 1–19 (2023). source

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    The utilization of DWT for secondary key generation and high-frequency sub-band substitution further enhances the encryption process.

    “The utilization of DWT for secondary key generation and high-frequency sub-band substitution further enhances the encryption process.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationreasoning

    The proposed encryption framework integrates innovative techniques that concurrently enhance both security and computational efficiency.

    “The proposed encryption framework distinguishes itself from existing encryption schemes through the strategic integration of innovative techniques. These methods are carefully chosen to concurrently enhance both security and computational efficiency.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    The introduction of TT for level-1 diffusion, along with a level-2 diffusion involving XOR operations, results in a multilayered security architecture.

    “The introduction of TT for level-1 diffusion, along with a level-2 diffusion in which XOR operations are involved results in a multilayered security architecture.”
    Quote in the paperNot a substantial claim

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    The incorporation of chaotic maps and FT ensures the dynamic behavior of initial pixel scrambling.

    “The incorporation of chaotic maps and FT ensures the dynamic behavior of initial pixel scrambling.”
    Quote in the paperNot a substantial claim

  • May combine two claims.

    Interpretationown data

    The proposed encryption technique demonstrates superior performance in both security and computational complexity compared to existing methods.

    “Several statistical analyses are conducted to evaluate the proposed encryption technique, demonstrating its superior performance in terms of both security and computational complexity compared to existing methods.”
    Quote in the paperSubstantial claim
    • Rests on an assumption: If the deviation in pixel intensities between the original and enciphered images is maximized, it indicates a higher level of security for the encryption technique.
32 of 32

  • The paper relies on this without support.

    Digital images have significant data content with high pixel correlation and redundancy.

    “Digital images are characterized by their significant data content, which exhibits high pixel correlation and redundancy.”

  • The paper relies on this without support.

    Sensitive images often become targets for malicious activities due to their vulnerability during transmission.

    “As per cybersecurity reports, sensitive images often become targets for malicious activities due to their vulnerability during transmission.”

  • The authors state this as an assumption.

    Low variance values in histogram variance analysis are desirable for robust encryption.

    “In the context of robust encryption, low variance values are desirable.”

  • The paper relies on this without support.

    If the deviation in pixel intensities between the original and enciphered images is maximized, it indicates a higher level of security for the encryption technique.

    “If the deviation in pixel intensities between the original and enciphered images is maximized, it indicates a higher level of security for the encryption technique.”
4 of 4

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.

  • Four-component diffusion equation uses a three-by-three matrix

    Major

    Equation (15) multiplies M to transform four pixel values, but M is defined as a 3×3 matrix. That multiplication is dimensionally incompatible as written.

  • Clipped fraction is converted to the wrong percentage

    Major

    One sixteenth of an image is 6.25%, not approximately 16.6%. The stated clipping percentage therefore describes a substantially larger attack than the stated fraction.

    Reported 16.6 · recomputed 6.25

  • Abstract histogram variance is absent from and far above reported results

    Major

    The abstract reports a histogram variance of 6458 for the proposed framework, whereas Table 5 reports proposed values around 260-267, including 260.637 for Einstein. No proposed value in that table supports the abstract's figure.

  • Abstract places substitution in a high-frequency band instead of LL4

    Minor

    The abstract identifies the substituted band as high-frequency, whereas the procedure substitutes LL4, which the paper identifies as a low-frequency sub-band.

  • Clipping fraction differs between the experiment description and Table 9

    Minor

    The description specifies clipping 1/16 of the image, while the table reporting the recovery result specifies 1/6. These are different attack sizes.

  • Conclusion substitutes LL1 rather than the specified LL4

    Minor

    The method specifies S-box substitution of LL4, but the conclusion says only LL1 is substituted. The decomposition level determines which sub-band undergoes the final operation.

  • Fibonacci sequence is assigned two different first values

    Minor

    The preliminaries first define f1 as 0, then later call f1 = 1 part of the Fibonacci series definition.

  • Tribonacci table disagrees with its stated initial values

    Minor

    Equation (7) sets t0 and t1 to 0, but Table 2 gives them as 13 and 24. The table is expressly presented as containing the numbers yielded by the recurrence.

  • Noise-test description names the wrong image as noisy

    Minor

    The body identifies Fig. 10c as a noisy plaintext image, while the figure caption identifies it as a noisy encrypted image. These describe different inputs to the reported decryption test.

9 of 9

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Ganavi, M. & Prabhudeva, S. Two-layer security of images using elliptic curve cryptography with discrete wavelet transform. Int. J. Comput. Netw. Inf. Secur. 13, 31 (2023).
  2. Ahmad, J. & Ahmed, F. Efficiency analysis and security evaluation of image encryption schemes. Computing 23, 25 (2010).

Cited by

Sorted by citations

Related

Authors
Hazzazi, M. M., Rehman, M. U., Shafique, A., Aljaedi, A., Bassfar, Z., & Usman, A. B.
Affiliations
  • King Khalid University (SA)
  • De Montfort University (GB)
  • University of Glasgow (GB)
  • University of Tabuk (SA)
  • University of Sunderland (GB)
Corresponding author
Rehman, Mujeeb Ur
ORCID
Venue
Scientific Reports
Publisher
Springer Science and Business Media LLC
Published
2024-05-29
Volume
14
Issue
1
Pages
12277-12277
ISSN
2045-2322 (ISSN-L)
DOI
10.1038/s41598-024-62260-3
PMC
PMC11637051
OpenAlex
W4399137408
Semantic Scholar
dc6f0b6569d974152f591514ecc3a6f3346758ba
Cited by
25
References
63
Citations by year
2026: 13 · 2025: 9 · 2024: 3
FWCI
3.60
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • Research at York St John (York St John University) (acceptedVersion, other-oa)
  • Sunderland Repository (University of Sunderland) (acceptedVersion)
  • PubMed Central (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
  • DMU Open Research Archive (De Montfort University) (submittedVersion, cc-by)
Funders
Mohammad Mazyad Hazzazi (R.G.P. 2/5/44)
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, discrete wavelet transform, pixel scrambling, pixel shuffling, substitution boxes, secret key generation, grayscale images, key space analysis, key sensitivity analysis, entropy analysis, correlation 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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-21.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-21.

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