Efficient chaotic permutations for image encryption algorithms
Permutation is widely used in cryptographic algorithm. Recently, a number of candidate instructions have been proposed to efficient compute arbitrary bit permutations. Among these, we present the most attractive methods and having good inherent cryptographic properties. We propose to control it by the perturbed chaotic maps that we studied in . Then, we measure the efficiency of the obtained chaotic permutation methods on a standard image. This study allows choosing a good chaotic permutation method to be used in a chaotic cryptosystem.