Chaotic Picture Scrambling Algorithm Based on Sort Transformation
Xiangdong Liu · 2005
This paper proposes an algorithm of chaotic images scrambling based on the sort transformation. The new algorithm obtains the address codes of the images transposition by the sort transformation of the chaotic sequence and does not need the quantification. The probability density function of the chaotic orbits must be known by the method of quantification. The new algorithm, however, overcomes this disadvantage, which not only facilitates the choice of chaotic systems but also reduces the time complexity of traversing the images scrambling quantified by chaos. As a result, it increases the speed of scrambling images. Due to the strong irregularity of sort transformation, the new chaotic images scrambling algorithm possesses high-level security. The paper also analyzes the scrambling performance of the new algorithm in a statistical way. The results of the analysis indicate that the algorithm bears nice scrambling capability and guarantees the security of the encrypted images effectively.