Chaotic Image Encryption Based on Running-Key Related to Plaintext
In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degr...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/490179 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1832559325932945408 |
---|---|
author | Cao Guanghui Hu Kai Zhang Yizhi Zhou Jun Zhang Xing |
author_facet | Cao Guanghui Hu Kai Zhang Yizhi Zhou Jun Zhang Xing |
author_sort | Cao Guanghui |
collection | DOAJ |
description | In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack. |
format | Article |
id | doaj-art-0b8e8679bf6b457b9892498eec4277f6 |
institution | Kabale University |
issn | 2356-6140 1537-744X |
language | English |
publishDate | 2014-01-01 |
publisher | Wiley |
record_format | Article |
series | The Scientific World Journal |
spelling | doaj-art-0b8e8679bf6b457b9892498eec4277f62025-02-03T01:30:19ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/490179490179Chaotic Image Encryption Based on Running-Key Related to PlaintextCao Guanghui0Hu Kai1Zhang Yizhi2Zhou Jun3Zhang Xing4Electronic & Information Engineering College, Liaoning University of Technology, Jinzhou 121001, ChinaSchool of Computer Science and Technology, Beihang University, Beijing 100191, ChinaElectronic & Information Engineering College, Liaoning University of Technology, Jinzhou 121001, ChinaElectronic & Information Engineering College, Liaoning University of Technology, Jinzhou 121001, ChinaElectronic & Information Engineering College, Liaoning University of Technology, Jinzhou 121001, ChinaIn the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack.http://dx.doi.org/10.1155/2014/490179 |
spellingShingle | Cao Guanghui Hu Kai Zhang Yizhi Zhou Jun Zhang Xing Chaotic Image Encryption Based on Running-Key Related to Plaintext The Scientific World Journal |
title | Chaotic Image Encryption Based on Running-Key Related to Plaintext |
title_full | Chaotic Image Encryption Based on Running-Key Related to Plaintext |
title_fullStr | Chaotic Image Encryption Based on Running-Key Related to Plaintext |
title_full_unstemmed | Chaotic Image Encryption Based on Running-Key Related to Plaintext |
title_short | Chaotic Image Encryption Based on Running-Key Related to Plaintext |
title_sort | chaotic image encryption based on running key related to plaintext |
url | http://dx.doi.org/10.1155/2014/490179 |
work_keys_str_mv | AT caoguanghui chaoticimageencryptionbasedonrunningkeyrelatedtoplaintext AT hukai chaoticimageencryptionbasedonrunningkeyrelatedtoplaintext AT zhangyizhi chaoticimageencryptionbasedonrunningkeyrelatedtoplaintext AT zhoujun chaoticimageencryptionbasedonrunningkeyrelatedtoplaintext AT zhangxing chaoticimageencryptionbasedonrunningkeyrelatedtoplaintext |