An image encryption scheme using sequence generated by interval bisection of polynomial function

Chaos based image encryption techniques are well accepted in research communities to perform permutation at pixel/bit level using pseudo-random sequence and changes pixel positions and/or intensity values from which guessing the original image is very hard. Simple computation is the point of attraction of these type of techniques. In parallel, researchers defined permutation using some non-chaotic methods and have established similar, even better results for image encryption in comparison to chaos based techniques. In this article a non-chaotic image encryption technique is proposed. A polynomial is employed to define the pseudo-random sequence. Here, points on the polynomial are selected by repeated interval bisection method and a sequence is defined by the function value at those points. Scrambling of row/column are performed by cyclic shift using the sequence. Value Substitution and iterative XOR operation transform the pixels’ intensity. Bitwise XOR operation with a mask generated from the pseudo-random sequence adds more security to the scheme. Experimental results and security analysis prove its immunity against statistical and differential attack. Comparison of the proposed method with some existing schemes proves its superiority.