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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Multimedia tools and applications Jg. 79; H. 35-36; S. 25635 - 25655
Hauptverfasser: Noshadian, Saeed, Ebrahimzade, Ata, Kazemitabar, Seyed Javad
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.09.2020
Springer Nature B.V
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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