2018
DOI: 10.5890/jand.2018.12.007
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Quasigroup Substitution Scheme for Chaos Based Image Encryption

Abstract: A novel quasigroup substitution scheme for chaos based image encryption During last two decades, there has been a prolific growth in the chaos based image encryption algorithms. Up to an extent these algorithms have been able to provide an alternative to exchange large media files (images and videos) over the networks in a secure way. However, there have been some issues with the implementation of chaos based image ciphers in practice. One of them is reduced/small key space due to the fact that chaotic behavio… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(2 citation statements)
references
References 23 publications
(27 reference statements)
0
2
0
Order By: Relevance
“…The proposed method in [14] generates initial conditions using 3D logistic maps, thus, these conditions are used to scramble the image, then the encryption key is generated by another 3D logistic map, and the XORing operation is done after converting the image into DNA representation. A combination of quasigroups and the chaotic standard map has been proposed in [15] to overcome the shortage of key-space, the algorithm achieved both substitution procedures by quasigroup of order 256, and the permutation procedure is done by the standard chaotic map.…”
Section: Related Workmentioning
confidence: 99%
“…The proposed method in [14] generates initial conditions using 3D logistic maps, thus, these conditions are used to scramble the image, then the encryption key is generated by another 3D logistic map, and the XORing operation is done after converting the image into DNA representation. A combination of quasigroups and the chaotic standard map has been proposed in [15] to overcome the shortage of key-space, the algorithm achieved both substitution procedures by quasigroup of order 256, and the permutation procedure is done by the standard chaotic map.…”
Section: Related Workmentioning
confidence: 99%
“…between the two cipher images [45]. Supposing the key utilized in the proposed algorithm is key , , We only increased a small error to one value and maintained the other six values to remain unchanged.…”
Section: Histogram Analysismentioning
confidence: 99%