A Chaotic Image Scrambling Scheme Based on Sorting Transformation

This paper proposed a chaotic image scrambling scheme based on sorting transformation. The algorithm calculates the permuting address codes by sorting the chaotic sequence. Therefore, the scheme does not require knowing the probability density function of the chaotic orbits in advance, thus not only facilitating the choice of chaotic systems but also reducing the complexity of the scheme. The paper also presented performance analysis of the scheme by statistical methods. The results indicate that the scheme can provide high level of security owing to the strong irregularity of sorting transformation.