2023
DOI: 10.1109/access.2023.3282160
|View full text |Cite
|
Sign up to set email alerts
|

Color Image Cryptosystem Based on Sine Chaotic Map, 4D Chen Hyperchaotic Map of Fractional-Order and Hybrid DNA Coding

Abstract: With advancements in computer and communication technologies, the production, utilization and applications of digital images is at an unprecedented rate. Recent applications include military communications, remote sensing, novel engineering designs storage and communications, as well as medical imaging. In most cases, such images convey highly sensitive or confidential information, which creates a strong need for the design of secure and robust color image cryptosystems. Recent literature has shown that fracti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 24 publications
(5 citation statements)
references
References 65 publications
0
5
0
Order By: Relevance
“…For one iteration cycle, the suggested scheme's key space value ≈2 540 is obtained. The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself.…”
Section: Brute Force Attackmentioning
confidence: 98%
See 1 more Smart Citation
“…For one iteration cycle, the suggested scheme's key space value ≈2 540 is obtained. The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself.…”
Section: Brute Force Attackmentioning
confidence: 98%
“…The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself. Subsequently, the proposed encryption algorithm with both schemes 1 and 2 has larger key space and has sufficient resistance to withstand brute force attack.…”
Section: Brute Force Attackmentioning
confidence: 98%
“…For one iteration cycle, the suggested scheme's key space value ≈2 540 is obtained. The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself.…”
Section: Brute Force Attackmentioning
confidence: 98%
“…The traditional algorithm [13,16,18,23,24,25,26] has lower key space, and schemes [17,27] have larger key space values than the proposed algorithms. The scheme [13,16,17,18,23,24,25,26] has achieved its optimal key space value of 2 100 after several rounds of iteration, whereas the proposed Scheme 1 and Scheme 2 have attained their ideal values for a one cycle of iteration itself. Subsequently, the proposed encryption algorithm with both schemes 1 and 2 has larger key space and has sufficient resistance to withstand brute force attack.…”
Section: Brute Force Attackmentioning
confidence: 98%
See 1 more Smart Citation