Color image encryption based on chaotic shit keying with lossless compression

In order to protect valuable data from undesirable readers or against illegal reproduction and modifications, there have been various data encryption techniques. Many methods are developed to perform image encryption. The use of chaotic map for image encryption is very effective, since it increase the security, due to its random behavior. The most attractive feature of deterministic chaotic systems is he extremely unexpected and random-look nature of chaotic signals that may lead to novel applications. A novel image encryption algorithm based on compression and hyper chaotic map techniques is proposed. Firstly the image is decomposed into three subbands R, G, and B then each band is compressed using lossless technique. The generated chaotic sequences from the 3D chaotic system are employed to code the compressed results by employing the idea of chaotic shift encoding (CSK) modulation to encode the three bands to generate the encrypted image. The experiments show that the proposed method give good results in term of security, feasibility, and robustness

Roadmap on optical security

Postprint (author's final draft

Extended of TEA: A 256 bits block cipher algorithm for image encryption

This paper introduces an effective image encryption approach that merges a chaotic map and polynomial with a block cipher. According to this scheme, there are three levels of encryption. In the first level, pixel positions of the image are scuffled into blocks randomly based on a chaotic map. In the second level, the polynomials are constructed by taking N unused pixels from the permuted blocks as polynomial coefficients. Finally, the third level a proposed secret-key block cipher called extended of tiny encryption algorithm (ETEA) is used. The proposed ETEA algorithm increased the block size from 64-bit to 256-bit by using F-function in type three Feistel network design. The key schedule generation is very straightforward through admixture the entire major subjects in the identical manner for every round. The proposed ETEA algorithm is word-oriented, where wholly internal operations are executed on words of 32 bits. So, it is possible to efficiently implement the proposed algorithm on smart cards. The results of the experimental demonstration that the proposed encryption algorithm for all methods are efficient and have high security features through statistical analysis using histograms, correlation, entropy, randomness tests, and the avalanche effect