2020
DOI: 10.1109/jphot.2020.2981494
|View full text |Cite
|
Sign up to set email alerts
|

A Novel 3D Vector Decomposition for Color-Image Encryption

Abstract: In this paper, a novel 3D vector decomposition is proposed for color-image encryption, in which a 3D vector is decomposed into two 3D vectors with random size in a random plane for providing a reliable security constraint. The technique of 3D vector decomposition, as far as we know, firstly offers a three-component encryption with one action, which fits well color-image encryption, and outputs a real ciphertext, which is convenient for recording and transmission. Furthermore, we employ an 1D chaos, which has s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 47 publications
0
6
0
Order By: Relevance
“…Compared with Refs. [13,[33][34][35][36][37], we can see that the correlation between the adjacent pixels of the ciphertext obtained by the encryption algorithm in this paper is smaller, so this algorithm has higher security and it can resist statistical attacks.…”
Section: Correlation Analysismentioning
confidence: 91%
See 1 more Smart Citation
“…Compared with Refs. [13,[33][34][35][36][37], we can see that the correlation between the adjacent pixels of the ciphertext obtained by the encryption algorithm in this paper is smaller, so this algorithm has higher security and it can resist statistical attacks.…”
Section: Correlation Analysismentioning
confidence: 91%
“…[35] 0.0006 -0.0017 -0.0008 Ref. [36] 0.0013 0.0022 0.0006 Ref. [37] -0.0747 -0.0015 -0.0013 The calculation formula is as follows:…”
Section: Correlation Analysismentioning
confidence: 99%
“…Step 11: Scramble pixels in the same position of the matrices R k , G k and B k randomly as described in equation (14). Figure 12 shows the specific illustration of the random scrambling of three-component pixels:…”
Section: Encryption Algorithmmentioning
confidence: 99%
“…Due to some inherent features of digital images, such as high redundancy [4], large data capacities and strong correlation [5], common encryption algorithms, such as the data encryption algorithm (DES) and international data encryption algorithm (IDEA), do not encrypt digital images effectively [6,7]. Chaos-based cryptosystems have better encryption performance [8,9] due to the inherent characteristics of chaotic systems, such as unpredictability [10], large bandwidth [11] and extreme sensitivity to system parameters and initial conditions [12][13][14][15]. Because a high-quality digital-image encryption scheme that combines logical mapping and chaotic systems was proposed in 1989 [16,17], many image encryption algorithms with high security have been successively designed [18][19][20].…”
Section: Introductionmentioning
confidence: 99%
“…In a word, chaotic encryption provides a new choice for traditional encryption. In recent years, many effective chaos image encryption algorithms have been proposed [13][14][15][16][17][18][19][20][21][22][23][24][25].…”
Section: Introductionmentioning
confidence: 99%