A New Image Scrambling Technique Only With A Specific Permutation

Chaos theory consistently plays an activerole in modern cryptography. The appeal of using chaos as the basis for the development of a cryptosystem lies primarily in its random behavior and its sensitivity to initial conditions and parameter settings that meet traditional Shannon requirements of confusion and diffusion. In this paper, just with a specific permutation we have created an effective image transformation we consider this last process as a phase of confusion. A shuffled image based on dynamic P-Table is presented, in which the P-Table are constructed by chaotic systems. The plain image is divided into edges in which the pixels are permuted by P-Table and in order to crush the correlation of adjacent pixels. After shuffling previous edges, we use a new chaotic sequence for scrambling the next edges. This technique named the inverse blending of pixels from the edges to the inwards. The results of this technique were studied using a one-dimensional function PWLCM map and then through another two-dimensional function HENON- LOZI map and we compared our technique with some recent scrambling techniques. In the end, experimental images and graphical curves show that the proposed method has excellent scrambling performance and achieves a high degree of harmonic security and that has a secret key of 177 bits in length. The results also show greater efficacy using on the twodimensional chaotic function than the one-dimensional chaotic map.