Abstract
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.
Highlights
With the rapid development of multimedia communications, the efficiency and security of image encryption transmission has become increasingly important
In our research we propose a fast color image encryption algorithm using 4-pixel Feistel structure and multiple chaotic systems
We perform multiple simulation experiments, including histogram and key space and speed analysis, measure the correlation of two adjacent pixels, and find the Number of Pixels Change Rate (NPCR), UACI, information entropy, and key sensitivity values to show that the proposed algorithm has good statistical and diffusion properties and can resist many different
Summary
With the rapid development of multimedia communications, the efficiency and security of image encryption transmission has become increasingly important. Due to the excellent security properties of chaos, such as ergodicity and sensitivity to initial conditions and parameters, chaos-based image encryption algorithms have attracted more and more attention since they were first proposed by the British mathematician Matthews R. in 1984 [1]. Afterwards, many chaotic image encryption algorithms have been designed based on different chaos maps and structures [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]. Color image encryption has recently attracted substantial attention
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
