Research on Chaotic Digital Image Encryption Algorithm

In view of the problems of pseudo-randomness, complexity, short period and limited precision of traditional digital image encryption technology, this paper improves the traditional chaotic digital image encryption technology. Firstly, a random sequence is generated from the chaotic map according to...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of physics. Conference series Ročník 1213; číslo 3; s. 32029 - 32035
Hlavní autori: Jia, Ye, Yu-fu, Zheng, Zi-wei, Yang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Bristol IOP Publishing 01.06.2019
Predmet:
ISSN:1742-6588, 1742-6596
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In view of the problems of pseudo-randomness, complexity, short period and limited precision of traditional digital image encryption technology, this paper improves the traditional chaotic digital image encryption technology. Firstly, a random sequence is generated from the chaotic map according to the definition, and then the design process is improved according to the encryption algorithm, and finally the simulation experiment is performed. The improved algorithm uses the Henon-mapped chaotic sequence to generate the shuffle control parameters, and replaces the gray value with the improved two-dimensional Logistic map sequence, shuffles the array using the Henon map, and changes the image pixels using the improved two-dimensional Logistic map. Grayscale values, these algorithms are highly secure against exhaustive attacks, statistical attacks, and plain-text attacks. Even if the attacker knows the algorithm, it does not know the parameters of the algorithm and cannot obtain image information. The improved encryption algorithm can increase the key space and improve the security performance of the encryption algorithm. The image viewing effect is also very good, and the time is greatly shortened, which can fully meet the real-time requirements.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1213/3/032029