A novel fast image encryption algorithm for embedded systems

Nowadays, embedded systems can be found everywhere in daily life. In the development of embedded systems, data security is one of the critical factors. Encryption is an effective way to protect data from threats. Among encryption algorithms, chaos-based methods have strong cryptographic properties s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Multimedia tools and applications Ročník 78; číslo 14; s. 20511 - 20531
Hlavní autori: Lin, Zhihao, Liu, Jizhao, Lian, Jing, Ma, Yide, Zhang, Xinguo
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.07.2019
Springer Nature B.V
Predmet:
Algorithms
Chaos theory
Computer Communication Networks
Computer Science
Cryptography
Cybersecurity
Data encryption
Data Structures and Information Theory
Embedded systems
Encryption
Initial conditions
Multimedia Information Systems
Parameter sensitivity
Special Purpose and Application-Based Systems
Chaos
Decorrelation
Security
Embedded system
Fast image encryption
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í:Nowadays, embedded systems can be found everywhere in daily life. In the development of embedded systems, data security is one of the critical factors. Encryption is an effective way to protect data from threats. Among encryption algorithms, chaos-based methods have strong cryptographic properties since chaotic systems are sensitive to initial conditions and parameters. However, most of these algorithms cannot be applied in practice because their encryption speed is not fast enough. In this paper, a fast image encryption algorithm is proposed. Compared with traditional chaos-based image encryption algorithms, the proposed method utilizes mixed-sequence and decorrelation operation to enhance the randomness of chaotic sequence. Moreover, it used minimum length of the sequence which is determined by experiments. Therefore, the proposed scheme spends much less computation time, which is an important advantage for being applied in practice. Testing results have shown that this algorithm has good performance in resisting known attacks, such as known-plaintext attacks, chosen ciphertext attacks, statistical attacks, differential attacks, and various brute-force attacks.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1380-7501
1573-7721
DOI:10.1007/s11042-018-6824-5