2019
DOI: 10.1016/j.eij.2018.10.001
|View full text |Cite
|
Sign up to set email alerts
|

A novel image encryption scheme based on 3D bit matrix and chaotic map with Markov properties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(15 citation statements)
references
References 23 publications
0
15
0
Order By: Relevance
“…The histogram is the distribution of distribution and the statistical intensity of the pixels of an image. The histogram analysis also functions to determine th e statistical performance of the image encryption algorithm [24]. The cipher image histogram must be very different from the plain image and have a uniform distribution of each pixel intensity.…”
Section: Histogram Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The histogram is the distribution of distribution and the statistical intensity of the pixels of an image. The histogram analysis also functions to determine th e statistical performance of the image encryption algorithm [24]. The cipher image histogram must be very different from the plain image and have a uniform distribution of each pixel intensity.…”
Section: Histogram Analysismentioning
confidence: 99%
“…Cryptographic research on images has been widely developed as in research carried out in [14][15][16][17][18][19][20][21][22][23]. Cryptography in images uses more permutation and diffusion techniques such as chaotic or shifting algorithms [14,24,25], this is because methods such as AES, DES and RSA Bulletin of Electr Eng & Inf ISSN: 2302-9285 …”
Section: Introductionmentioning
confidence: 99%
“…The authors in Ref. [20] proposed an effective bit-level image encryption plan based on a 3D cat map, reverse 3D cat map and an improved class of chaotic maps with Markov properties. In this strategy, firstly, the plain-image is converted into a binary matrix, and then the sum of all the bits in this matrix is used as part of the secret keys; secondly, a mapping is designed; and, thirdly, a chaotic map with Markov properties is used in the diffusion process.…”
Section: Previous Workmentioning
confidence: 99%
“…Ideal encryption scheme should reduce the correlation of adjacent pixels. From the plain images (lena, baboon, pepper) and from the encrypted images (lena, baboon, pepper), 10 3 adjacent pixels are selected in the horizontal, vertical and diagonal directions to calculate their correlation coefficients by using following equations [36]:…”
Section: H Correlation-coefficient Analysismentioning
confidence: 99%