Fast Algorithm for Color Image Scrambling
Wei Weimin · Jisuanji gongcheng · 2008
This paper proposes a scrambling scheme for color image without iterative computation. By shifting the rows and columns, the relativity among the adjacent pixels is scrambled. To improve the security, the method of storing color components in different pixels is applied. During the shift, different color components have different parameters. Then image is divided into blocks. XOR operation is used to alter the pixel value in each block and the operand of XOR is determined by the position of pixel. Theoretical analysis and experimental results show that the algorithm is effective and secure. It is faster than Arnold transform method.