Image Scrambling Using R-Prime Shuffle on Image and Image Blocks

Abstract—Abstract Nowadays Digital Images have become a major source of Information. This information when transmitted across the network, security of the same becomes important. Image scrambling technique are been used for providing security to digital Images. A number of methods have been proposed to calculate the periodicity of Arnold Transformation. In the traditional Arnold Transformation is improved by adding two parameter a and b. To generate parameter sequences , logistic map has been used. Arnold transformation is been applied on each block with different parameters. The method gives good encryption effects. It also has a very large key space and key sensitivity.An improved Image scrambling technique was proposed.When the image was scrambled in spatial domain,image unchangeable coefficient rule in Discrete Cosine Transform(DCT) and Wavelet Transformation was proved. Based on the constructed composite chaotic iterative dynamic system whose invariant distribution density was one, and in order to initialize for composite chaotic iterative dynamic system, it put forward two functions using image scramble constant as input parameter. Then a fragile and adaptive image scrambling algorithm and two new scrambling evaluative parameter were introduced called as similar degree and anti-tamper radius. The experimental results showed that the original image could be extracted without any concessional information. The technique was sensitive to all kinds of attacks. The anti tamper radius obtained was larger than the current scrambling techniques.To overcome the drawbacks of the traditional queue transformation a improved method is proposed. This proposed variation only needs a single step instead of two steps to complete the scrambling process.