2022
DOI: 10.3390/math10071027
|View full text |Cite
|
Sign up to set email alerts
|

Image Encryption Schemes Based on a Class of Uniformly Distributed Chaotic Systems

Abstract: This paper proposes a method to construct a one-dimensional discrete chaotic system. First, we define a generalized distance function to control the boundedness of the one-dimensional discrete system. Based on Marotto’s theorem, one-dimensional discrete systems are proven to be chaotic in the sense of Li–Yorke, and the corresponding chaos criterion theorem is proposed. The system can be distributed uniformly by adjusting the parameters. In this paper, we propose an image encryption scheme based on a uniformly … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…The times taken for the encryption and decryption processes are shown in Table 9. The experimental results show that our efficiency is slightly lower than that of reference [8], but it is much better than that of reference [29]. Generally speaking, our efficiency is acceptable.…”
Section: Encryption Efficiency Analysismentioning
confidence: 69%
See 1 more Smart Citation
“…The times taken for the encryption and decryption processes are shown in Table 9. The experimental results show that our efficiency is slightly lower than that of reference [8], but it is much better than that of reference [29]. Generally speaking, our efficiency is acceptable.…”
Section: Encryption Efficiency Analysismentioning
confidence: 69%
“…We conducted experiments on the greyscale images of Lena and Cameraman with a size of 256 × 256 using the system proposed in this paper, as well as the systems proposed in references [8] and [29]. The times taken for the encryption and decryption processes are shown in Table 9.…”
Section: Performance Analysesmentioning
confidence: 99%
“…The obtained correlation coefficients are lower compared to those of other existing algorithms, indicating a higher level of pixel diffusion and reduced correlation between neighboring pixels. Table 7 presents a comparative analysis of our proposed approach with the methods proposed by Zang [31], Zhu [33,34], and Es-Sabry [10]. The results clearly demonstrate that our encryption method outperforms the other competing methods in terms of correlation coefficient.…”
Section: B Correlation Analysismentioning
confidence: 87%
“…Image Size (dpi) Encryption Time (s) [38] 512 × 512 1.8876 [39] 512 × 512 1.3105 [40] 512 × 512 3.893 This work 512 × 512 1.1726…”
Section: Encryption Algorithmmentioning
confidence: 98%