A Robust and Fast Image Encryption Scheme Based on a Mixing Technique

Algorithm 3

Pseudo-code of the mixing process.

(1)	Divide the image (permuted image) of size into two parts and of the same size. and , with .
(2)	Choose initial conditions , and control parameter to generate two chaotic sequences by iterating equation (1) of the May-Gompertz system times.
(3)	Also, divide , respectively, into two subblocks of the same size (see Figure 6).
	The values of X and Y must be integer values in order to recover all the information during the decryption phase. For the simulations, we have chosen .
(4)	Choose initial conditions and control parameters, and , to generate a chaotic sequence by iterating times. The values obtained are stored in an array of size .
(5)	Subdivide the array into 4 parts, each having the same size of the image I.
(6)	Combine the two blocks and of the permuted image using the nonlinear relationship defined by equation (8) to get the ciphered image.
	where represents the fused image (encrypted), with and , , and floor(X) rounds the elements of X to the nearest integers.