2021
DOI: 10.1016/j.chaos.2021.111235
|View full text |Cite
|
Sign up to set email alerts
|

A new efficient permutation-diffusion encryption algorithm based on a chaotic map

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
13
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 73 publications
2
13
0
Order By: Relevance
“…This metric has no specific threshold, but lower values indicate lower sensibility of the ciphered image's histogram uniformity that to small changes either in the original image or in the secret key. The metrics presented in Table 2 are consistent with [7], meaning that the encrypted image still maintains an uniform histogram when the original image or the secret key are modified.…”
Section: Statistical Attackssupporting
confidence: 58%
See 2 more Smart Citations
“…This metric has no specific threshold, but lower values indicate lower sensibility of the ciphered image's histogram uniformity that to small changes either in the original image or in the secret key. The metrics presented in Table 2 are consistent with [7], meaning that the encrypted image still maintains an uniform histogram when the original image or the secret key are modified.…”
Section: Statistical Attackssupporting
confidence: 58%
“…In Table 7, the PSNR values are given for the recovered images, and those are consistent with other works, validating the fact that the proposed algorithm resists noise and occlusion attacks. These values represent a small increase compared to [7] because the ECB operation mode is not used, and hence the effects of noise are not propagated as much during the recovered image.…”
Section: Noise and Occlusion Attacksmentioning
confidence: 99%
See 1 more Smart Citation
“…where h(x s ) is the probability that s occurs within the image p, N then denotes the gray level of the image p. For this test, multiple kinds of images are selected to calculate their Inf values, and the results are presented in Table 5. The table shows that after the encryption algorithm, all the [29] 0.0095 0.0044 0.0076 Yadollahi [30] 0.0208 0.0137 0.0146 Zhou [31] -0.0057 -0.0121 0.0029 Lai [32] 0.0015 0.0048 0.0016 Bazerra [33] -0.0018 0.0025 -0.0015 Zheng [34] -0.0027 0.0023 0.0088 Hussain [35] 0.0002 -0.0014 -0.0018 Su [36] 0.0019 0.0021 0.0029 Wang [37] 0.0005 0.0051 -0.0034 Pak [38] 0.0005 0.0024 -0.0017 Zhang [39] 0.0190 -0.0302 -0.0648 Wang [40] 0.0138 0.0113 0.0053 Luo [41] -0.0019 0.0021 -0.0046 Zhang [42] -0.0351 0.0238 -0.0057 entropy values are greater than 7.99, infinitely close to 8. In addition, we compared the information entropy values of of Baboon image from other schemes, displayed in Table 6.…”
Section: Information Entropy Analysismentioning
confidence: 99%
“…Although some chaotic maps have excellent uniformity or large Lyapunov index, their ergodic and randomness performance is limited [59]. In addition, the iterative nature of one-dimensional chaotic mapping is a kind of compound [60]. Therefore, in order to improve the performance of chaotic mapping, it is necessary to carry out cross composition and high-dimensional expansion of chaotic mapping [61].…”
Section: Chaotic Mapmentioning
confidence: 99%