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

An Image Encryption Algorithm Based on Logistic-Fibonacci Cascade Chaos and 3D Bit Scrambling

Abstract: Aiming at the problem that the existing bit scrambling encryption algorithm is not sensitive to the bit scrambling between 8 bits of one pixel, and the anti-noise and anti-selective plaintext attack ability is weak, a 3D cyclic shift bit scrambling image encryption algorithm is proposed in this paper. Discarding the scrambling mode of 8 bits of one pixel and the bits of all pixels, the pixel values are converted into binary arrays and then converted into 3D matrices in this paper. And the higher bit-planes and… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 27 publications
0
11
0
Order By: Relevance
“…Since our goal is to effectively resist various attacks on image data while also limiting the hardware complexity, we combine hyperchaotic masking with an additional easyto-implement confusion process. In particular, we add Arnold cat mapping [40] for Scheme 1 , and bit scrambling [41] for Scheme 2 . We choose the Arnold cap map since only pixel positions are scrambled.…”
Section: B Potential Image Encryption Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since our goal is to effectively resist various attacks on image data while also limiting the hardware complexity, we combine hyperchaotic masking with an additional easyto-implement confusion process. In particular, we add Arnold cat mapping [40] for Scheme 1 , and bit scrambling [41] for Scheme 2 . We choose the Arnold cap map since only pixel positions are scrambled.…”
Section: B Potential Image Encryption Methodsmentioning
confidence: 99%
“…To achieve improved encryption performance using Scheme 2 , we adopt 3D bit scrambling to remove inter-pixel correlations [41]. Let us define m and n as the plaintext image dimensions, and k as the number of higher (i.e., more significant) bits.…”
Section: B 3d Bit Scramblingmentioning
confidence: 99%
“…The key space of this work is at least2003×(1014)6×22569.2634×10167. From the security point of view, the key space21001030can meet the higher security level [24, 37], so the key space of this algorithm is safe for brute‐force attack.…”
Section: Experimental Analysismentioning
confidence: 99%
“…However, the scrambling effect of some particularly bright or dark images is not ideal. Although the high-order and low-order bits are separated and scrambled in literature works [24,25], the number of bits with different weights is exchanged to some extent, resulting in the decrease of robustness of the algorithm. The ciphertext encrypted by the above encryption methods is all noise-like images or texture-like images.…”
Section: Introductionmentioning
confidence: 99%
“…The scrambling operation can not only change the pixel value but also break the correlation with the original pixel value, making the image encryption more secure [13], [14], [15], [16]. Many bit-based encryption methods have been proposed to reduce the correlation between adjacent pixels [17], [18]. However, these encryption techniques have some limitations.…”
Section: Introductionmentioning
confidence: 99%