You are looking at a specific version 20100305:120851 of this paper. See the latest version.

Paper 2010/045

Efficient chaotic permutations for image encryption algorithms

Abir AWAD

Abstract

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 [1]. 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.

Metadata
Available format(s)
-- withdrawn --
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
awad @ esiea-ouest fr
History
2010-03-05: withdrawn
2010-01-29: received
See all versions
Short URL
https://ia.cr/2010/045
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.