Efficient image scrambling based on any chaotic map

This paper presents a new image permutation algorithm to improve permutation efficiency. Based on uniform trend theorem and ideal bias theorem, we propose two classes of extractors, which solve the critical problem of any chaotic sequence uniformity. Then, the uniform chaotic sequence is transformed into integer space and the random integers are used to perform one-dimensional data permutation algorithm, which is based on data position interchange. Based on the data vector permutation, a secure and efficient image permutation is presented. Comparing with previous approaches, the proposed scheme is secure and its efficiency is enhanced.