A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure.
Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structu...
Main Authors: | , , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2016-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5100896?pdf=render |
id |
doaj-b58af353348248ea9e811caa99cce0fd |
---|---|
record_format |
Article |
spelling |
doaj-b58af353348248ea9e811caa99cce0fd2020-11-25T01:45:09ZengPublic Library of Science (PLoS)PLoS ONE1932-62032016-01-011111e016593710.1371/journal.pone.0165937A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure.Wang YaoFaguo WuXiao ZhangZhiming ZhengZhao WangWenhua WangWangjie QiuAlgorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms.http://europepmc.org/articles/PMC5100896?pdf=render |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Wang Yao Faguo Wu Xiao Zhang Zhiming Zheng Zhao Wang Wenhua Wang Wangjie Qiu |
spellingShingle |
Wang Yao Faguo Wu Xiao Zhang Zhiming Zheng Zhao Wang Wenhua Wang Wangjie Qiu A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure. PLoS ONE |
author_facet |
Wang Yao Faguo Wu Xiao Zhang Zhiming Zheng Zhao Wang Wenhua Wang Wangjie Qiu |
author_sort |
Wang Yao |
title |
A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure. |
title_short |
A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure. |
title_full |
A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure. |
title_fullStr |
A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure. |
title_full_unstemmed |
A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure. |
title_sort |
fast color image encryption algorithm using 4-pixel feistel structure. |
publisher |
Public Library of Science (PLoS) |
series |
PLoS ONE |
issn |
1932-6203 |
publishDate |
2016-01-01 |
description |
Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms. |
url |
http://europepmc.org/articles/PMC5100896?pdf=render |
work_keys_str_mv |
AT wangyao afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT faguowu afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT xiaozhang afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT zhimingzheng afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT zhaowang afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT wenhuawang afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT wangjieqiu afastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT wangyao fastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT faguowu fastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT xiaozhang fastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT zhimingzheng fastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT zhaowang fastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT wenhuawang fastcolorimageencryptionalgorithmusing4pixelfeistelstructure AT wangjieqiu fastcolorimageencryptionalgorithmusing4pixelfeistelstructure |
_version_ |
1725024702106173440 |