Breaking a chaotic image encryption algorithm

Image encryption is an important issue in information security. Due to sensitivity to initial values, randomness and simple computation, chaos-based image encryption algorithms efficiently provide security. In a recent paper a chaos-based image encryption was proposed that employs genetic algorithm...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Multimedia tools and applications Ročník 79; číslo 35-36; s. 25635 - 25655
Hlavní autori: Noshadian, Saeed, Ebrahimzade, Ata, Kazemitabar, Seyed Javad
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.09.2020
Springer Nature B.V
Predmet:
Algorithms
Computer Communication Networks
Computer Science
Computer simulation
Correlation coefficients
Data Structures and Information Theory
Encryption
Genetic algorithms
Multimedia Information Systems
Pixels
Special Purpose and Application-Based Systems
Image encryption
Logistic map
Knuth shuffle
Genetic algorithm
Chaotic
ISSN:1380-7501, 1573-7721
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Image encryption is an important issue in information security. Due to sensitivity to initial values, randomness and simple computation, chaos-based image encryption algorithms efficiently provide security. In a recent paper a chaos-based image encryption was proposed that employs genetic algorithm to optimize correlation between adjacent pixels. We show via simulations a security exploit that can find the key and decrypt the image. To fix the the aforementioned vulnerability we harness Knuth shuffle where we replace the rand function with the logistic map. We then evaluate the security of our proposed algorithm by testing the impact of several attacks on it. We show that while improving the security, our algorithm keeps the same level of pixel entropy as the previous method. Moreover, the correlation coefficient among adjacent pixels of the cipher image was reduced by an order of magnitude.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-020-09233-6