A Non-symmetric Digital Image Secure Communication Scheme Based on Generalized Chaos Synchronization System

Based on a generalized chaos synchronization system and a discrete Sinai map, a non-symmetric true color(RGB) digital image secur e communication scheme is proposed. The scheme first changes an ordinary RGB digital image with 8 bits into unrecognizable disorder codes and then transforms the disorder codes into an RGB digital image with 16 bits for transmitting. A receiver uses a non-symmetric key to verify the authentication of the received data origin,and decrypts the ciphertext. The scheme can encrypt and decrypt most formatted digital RGB images recognized by computers, and recover the plaintext almost without any errors. The scheme is suitable to be applied in network image communications. The analysis of the key space, sensitivity of key parameters, and correlation of encrypted images imply that this scheme has sound security.     

Phase image encryption of colored images using double random phase encoding technique in HSV color space

A double random phase encoding based digital phase encryption technique for colored images is proposed in the Fourier domain. The RGB input image is brought to HSV color space and then converted into phase, prior to the encryption. In the decryption process the HSV image is and converted back to the RGB format. The random phase codes used during encryption are prepared by stacking three two-dimensional random phase masks. These random phase codes serve as keys for encryption and decryption. The proposed technique carries all the advantages of phase encryption and is supposedly three-dimensional in nature. Robustness of the technique is analyzed against the variations in random phase codes and shuffling of the random phase masks of a given phase code. Performance of the scheme is also verified against occlusion of Fourier plane random phase code as well as the encrypted image. Effects of noise attacks and attacks using partial windows of correct random phase codes have also been checked. Digital simulations are presented to support the idea.     

Color-image encryption scheme based on channel fusion and spherical diffraction

A secure encryption scheme for color images based on channel fusion and spherical diffraction is proposed in this paper. In the proposed encryption scheme, a channel fusion technology based on the discrete wavelet transformation is used to transform color images into single-channel grayscale images, firstly. In the process of transformation, the hyperchaotic system is used to permutate and diffuse the information of red—green—blue (RGB) channels to reduce the correlation of channels. Then the fused image is encrypted by spherical diffraction transform. Finally, the complex-valued diffraction result is decomposed into two real parts by the improved equal module decomposition, which are the ciphertext and the private key. Compared with the traditional color image encryption schemes that encrypt RGB channels separately, the proposed scheme is highly secure and robust.     

Fractional Fourier transform based image multiplexing and encryption technique for four-color images using input images as keys

A digital technique for multiplexing and encryption of four RGB images has been proposed using the fractional Fourier transform (FRT). The four input RGB images are first converted into their indexed image formats and subsequently multiplexed into a single image through elementary mathematical steps prior to the encryption. The encryption algorithm uses two random phase masks in the input- and the FRT domain, respectively. These random phase masks are especially designed using the input images. As the encryption is carried out through a single channel, the technique is more compact and faster as compared to the multichannel techniques. Different fractional orders, the random masks in input-, and FRT domain are the keys for decryption as well as de-multiplexing. The algorithms to implement the proposed multiplexing-, and encryption scheme are discussed, and results of digital simulation are presented. Simulation results show that the technique is free from cross-talk. The performance of the proposed technique has also been analyzed against occlusion, noise, and attacks using partial windows of the correct random phase keys. The robustness of the technique against known-, and chosen plain-text attacks has also been explained.     

Logarithms-based RGB image encryption in the fractional Fourier domain: A non-linear approach

We propose a non-linear image encryption scheme for RGB images, using natural logarithms and fractional Fourier transform (FRT). The RGB image is first segregated into the component color channels and each of these components is hidden inside a random mask (RM) using base changing rule of logarithms. Subsequently, these channels are encrypted independently using random phase masks (RPMs) and the FRT. The fractional orders of the FRT, input random masks and random phase masks used in each channel serve as the keys for encryption and decryption. The algorithms to implement the proposed scheme are discussed, and results of digital simulation are presented. The robustness of the technique is analyzed against the variation in fractional orders of the FRT, change of RMs and RPMs, and occlusion of the encrypted data, respectively. Performance of the scheme has also been studied against the attacks using noise and partial windows of the correct RPMs. The proposed technique is shown to perform better against some attacks in comparison to the conventional linear methods.     

A Robust Blind Quantum Copyright Protection Method for Colored Images Based on Owner’s Signature

Watermarking is the imperceptible embedding of watermark bits into multimedia data in order to use for different applications. Among all its applications, copyright protection is the most prominent usage which conceals information about the owner in the carrier, so as to prohibit others from assertion copyright. This application requires high level of robustness. In this paper, a new blind quantum copyright protection method based on owners’s signature in RGB images is proposed. The method utilizes one of the RGB channels as indicator and two remained channels are used for embedding information about the owner. In our contribution the owner’s signature is considered as a text. Therefore, in order to embed in colored image as watermark, a new quantum representation of text based on ASCII character set is offered. Experimental results which are analyzed in MATLAB environment, exhibit that the presented scheme shows good performance against attacks and can be used to find out who the real owner is. Finally, the discussed quantum copyright protection method is compared with a related work that our analysis confirm that the presented scheme is more secure and applicable than the previous ones currently found in the literature.     

Binary encoding method to encrypt Fourier-transformed information of digital images

An encoding method is used to encrypt the Fourier-transformed information of a hidden (covert) digital image in an overt image, while the Fourier-transformed information must be encoded with binary codes. All of the pixels in an overt image are classified into five groups that are called identification, type, tracing, dimension, and information codes. Identification codes are used to judge if the overt image contains codes that belong to the proposed encoding method or not; type codes are used to judge the encoding type; tracing codes are used to judge the encoding trace; dimension codes are used to judge the size of the hidden information; and information codes are used to decode the hidden information. Applying the proposed encoding method is rather easy, and host images corresponding to overt images are not needed for decoding work. The experiment has demonstrated four types of encoding for the proposed encoding method to reconstruct covert images without any distortion or only with a little distortion.     

Color image encryption and decryption for twin images in fractional Fourier domain

We propose a method for the encryption of twin color images using fractional Fourier transform (FRT). The color images to be encrypted are converted into the indexed image formats before being processed through twin image encryption algorithm based on the FRT. The proposed algorithm uses one random code in the image domain and one random phase code in the FRT domain to perform double image encryption. The conversion of both the input RGB images into their indexed formats facilitates single-channel processing for each image, and is more compact and robust as compared to multichannel techniques. Different fractional orders, the random masks in image- and FRT domain are the keys to enhance the security of the proposed system. The algorithms to implement the proposed encryption and decryption schemes are discussed, and results of digital simulation are presented. We examine sensitivity of the proposed scheme against the use of unauthorized keys (e.g. incorrect fractional orders, incorrect random phase mask etc.). Robustness of the method against occlusion and noise has also been discussed.     

Encrypting image by assembling the fractal-image addition method and the binary encoding method

The fractal-image addition method and the binary encoding method are assembled to form a hybrid method for encrypting a digital covert image. For this hybrid method, a host image is used to create an overt image with the information of the covert image. First, the fractal-image addition method is used to add some fractal images and the covert image to form an image-mixing matrix. Then, all the pixel values of the image-mixing matrix are transferred into binary data. Finally, the binary data are encoded into the host image to create an overt image. The pixels of the overt image contain eight groups of codes used for reconstructing the covert image. The eight groups of codes are identification codes, row amount codes, covert-image dimension codes, fractal-image amount codes, starting-pixel codes, character amount codes, character codes, and information codes. The overt image and the host image look almost the same for eyes. Furthermore, the covert image can be directly reconstructed from the overt image without using the host image. The most important feature is that the reconstructed covert image is identical to the original covert image, i.e. there is no distortion in the decoding work.     

Alterable-capacity fragile watermarking scheme with restoration capability

To take invisibility and restoration quality into account, this paper proposes an alterable-capacity watermarking scheme. For each block of size 8 × 8 pixels, the alterable-length code is generated based on the roughness of it. The alterable-length watermark generated by the alterable-length code is divided into three parts and embedded in other three blocks based on the secret key. The authenticity of each block is determined by comparing the watermark reconstructed by the block content and the corresponding extracted watermark. To improve the quality of recovered images, two copies of the significant-code of each block are embedded in different blocks and the image inpainting method is adopted to recover the tampered blocks whose significant-code embedded in other blocks is destroyed. The alterable-payload watermark preserves adequate information of image blocks especially for texture images with as few bits as possible and takes into account invisibility, security and restoration quality. Experimental results demonstrate that the proposed scheme improves the quality of watermarked and reconstructed images and is resilient to the known forgery attacks.     

Image encryption with chaotic random codes by grey relational grade and Taguchi method

This paper presents a novel scheme for implementation of quasi-optimal chaotic random codes (CRC). Usually, the localization grey relational grade (LGRG) approaches 1 by using less random codes to encrypt digital color images. On the contrary, randomized codes cause highly independent images. In this paper, the LGRG between original and encoded image is used as the quality characteristic, and the chaotic system’s initial values x₀, y₀ and z₀ which influence the quality characteristic are chosen as control factors and the levels are also decided. According to the control factors and levels, this paper applied a Taguchi orthogonal array for the experiments, and generated a factor response graph, to figure out a set of chaotic initial values. Finally, the quasi-optimal CRC are decided by these initial values. Eventually, the most effective encryption of digital color images can be obtained by applying the quasi-optimal CRC. The experimental results have demonstrated that the proposed scheme is feasible and efficient.     

Gray-Level Image Encryption Scheme Using Full Phase Encryption and Phase-Encoded Exclusive-OR Operations

A new gray-level image encryption scheme based on phase-encoded exclusive-OR (XOR) operations and a full phaseencoding method is presented. The gray-level image can be sliced into binary images which have the same pixel level, and each of them is encrypted by phase-encoded XOR operations with each phase-encoded binary random image. We combine XORed images and phase-encoded binary random images into an encrypted image and a key image, respectively. Gray-level encrypted data and key data are obtained by the phase-encoding process of the encrypted image and the key image in a space domain. The decryption process is simply implemented by using a phasevisualization system and the performance of the proposed scheme is evaluated by computer simulation.     

Hybrid encoding method by assembling the magic-matrix scrambling method and the binary encoding method in image hiding

The magic-matrix scrambling method and the binary encoding method are combined to form a hybrid encoding method for hiding digital covert images. For this hybrid encoding method, a covert image is encoded into a host image to form an overt image. First, the magic-matrix scrambling method is used to rearrange all the pixels of the covert image by using a specified magic matrix modified from a magic square to form a scrambled matrix. Then, all the pixels of the scrambled matrix are denoted by binary data. Finally, the binary data are encoded into the host image to form the overt image. The pixels of the overt image contain nine groups of codes used for decoding the covert image, i.e. identification codes, covert-image dimension codes, scrambling-time codes, magic-square dimension codes, corner codes, shifting codes, arrangement codes, graylevel codes, and information codes. The overt image and the host image look almost the same for eyes. Furthermore, the covert image can be decoded directly from the overt image without using the host image. The most important feature is that the decoded covert image is identical to the original covert image, i.e. there is no distortion in the decoding work.     

Novel image encryption algorithm based on cycle shift and chaotic system

In this paper, a novel image encryption algorithm is proposed. The cycle shift in bits of pixels and the chaotic system are employed for the encryption of the proposed scheme. For cycle shift operations, random integers with the same size of the original image are produced to scramble the plaintext image. Moreover, the scrambled image effects the initial values of the chaotic system for the further encryption process, which increases the sensitivity of plaintext images of the scheme. The scrambled image is encrypted into the ciphered image by the keys which are produced by the chaotic system. The simulation experiments and theoretical analyses indicate that the proposed scheme is superior and able to resist exhaustive attack and statistical attack.     

Acquiring multi-spectral images by digital still cameras based on XYZLMS interim connection space

A method based on the XYZLMS interim connection space is proposed to accurately acquire the multi-spectral images by digital still cameras. The XYZLMS values are firstly predicted from RGB values by polynomial model with local training samples and then spectral reflectance is constructed from XYZLMS values by pseudo-inverse method. An experiment is implemented for multi-spectral image acquisition based on a commercial digital still camera. The results indicate that multi-spectral images can be accurately acquired except the very dark colors.     

Blind and Secured Adaptive Digital Image Watermarking Approach for High Imperceptibility and Robustness

In the past decade, rapid development in digital communication has led to prevalent use of digital images. More importantly, confidentiality issues have also come up recently due to the increase in digital image transmission across the Internet. Therefore, it is necessary to provide high imperceptibility and security to digitally transmitted images. In this paper, a novel blind digital image watermarking scheme is introduced tackling secured transmission of digital images, which provides a higher quality regarding both imperceptibility and robustness parameters. A block based hybrid IWT- SVD transform is implemented for robust transmission of digital images. To ensure high watermark security, the watermark is encrypted using a Pseudo random key which is generated adaptively from cover and watermark images. An encrypted watermark is embedded in randomly selected low entropy blocks to increase the security as well as imperceptibility. Embedding positions within the block are identified adaptively using a Blum–Blum–Shub Pseudo random generator. To ensure higher visual quality, Initial Scaling Factor (ISF) is chosen adaptively from a cover image using image range characteristics. ISF can be optimized using Nature Inspired Optimization (NIO) techniques for higher imperceptibility and robustness. Specifically, the ISF parameter is optimized by using three well-known and novel NIO-based algorithms such as Genetic Algorithms (GA), Artificial Bee Colony (ABC), and Firefly Optimization algorithm. Experiments were conducted for the proposed scheme in terms of imperceptibility, robustness, security, embedding rate, and computational time. Experimental results support higher effectiveness of the proposed scheme. Furthermore, performance comparison has been done with some of the existing state-of-the-art schemes which substantiates the improved performance of the proposed scheme.     

Statistical tests and chaotic synchronization based pseudorandom number generator for string bit sequences with application to image encryption

Recently, a stream encryption scheme using d-bit segment sequences has been proposed. This scheme may generate key avalanche effect. The randomness tests of d-bit segment pseudorandom number generator will be important for implementing such a scheme. Firstly this paper extends Beker and Piper’s binary pseudorandom sequence statistical test suite to d-bit segment sequences case. Secondly, a novel 3-dimensional polynomial discrete chaotic map (3DPDCM) is proposed. The calculated Lyapunov exponents of the 3DPCDM are 0.213, 0.125 and ? 3.228. Using the 3DPDCM constructs a 6-dimensional generalized synchronization chaotic system. Based on this system, a 8-bit segment chaotic pseudorandom number generator (CPRNG) is introduced. Using the generalized test suite tests 100 key streams generated via the 8-bit PRNG with different initial conditions and perturbed system parameters. The tested results are similar to those of the key streams generated via RC4 PRNG. As an application, using the key streams generated via the CPRNG and the RC4 PRNG encrypts an RGB image Landscape. The results have shown that the encrypted RGB images have significant avalanche effects. This research suggests that the requirements for PRNGs are not as strict as those under the traditional avalanche criteria. Suitable designed chaos-based d-bit string PRNGs may be qualified candidates for the stream encryption scheme with avalanche effect.     

A novel chaotic image encryption algorithm based on water wave motion and water drop diffusion models

This paper will put forward a novel chaotic image encryption algorithm with confusion–diffusion architecture. First of all, secret keys will be processed by key generator before they can really be used in the encryption scheme, and in this stage this paper associates plain image with secret keys; Secondly, by imitating the trajectory of water wave movement, encryption algorithm will do scrambling operations to the image. Thirdly, this paper combines water drop motion and dynamic look up table to realize diffusion operations. For an 8 bits pixel, this algorithm will just dispose the higher 4 bits, which is because the higher 4 bits contain the vast majority of information of the image. At last, the experiment results and security analysis show that this proposed algorithm has a desirable encryption effect. Its key space is large enough, it is sensitive to keys and plain image, its encryption speed is fast and it can resist cryptanalysis such as brute attack, differential attack, etc.     

Triple image encryption scheme in fractional Fourier transform domains

We proposed a triple image encryption scheme by use of fractional Fourier transform. In this algorithm, an original image is encoded in amplitude part and other two images are encoded into phase information. The key of encryption algorithm is obtained from the difference between the third image and the output phase of transform. In general case, random phase encoding technology is not required in the proposed algorithm. Moreover, all information of images is preserved in theory when image are decrypted with correct key. The optical implementation of the algorithm is presented with an electro-optical hybrid structure. Numerical simulations have demonstrated the efficiency and the security of this algorithm. Based on this scheme a multiple image algorithm is expanded and designed.     

Plaintext-Related Dynamic Key Chaotic Image Encryption Algorithm

To address the problems of the high complexity and low security of the existing image encryption algorithms, this paper proposes a dynamic key chaotic image encryption algorithm with low complexity and high security associated with plaintext. Firstly, the RGB components of the color image are read, and the RGB components are normalized to obtain the key that is closely related to the plaintext, and then the Arnold transform is used to stretch and fold the RGB components of the color image to change the position of the pixel points in space, so as to destroy the correlation between the adjacent pixel points of the image. Next, the generated sequences are independently encrypted with the Arnold-transformed RGB matrix. Finally, the three encrypted images are combined to obtain the final encrypted image. Since the key acquisition of this encryption algorithm is related to the plaintext, it is possible to achieve one key per image, so the key acquisition is dynamic. This encryption algorithm introduces chaotic mapping, so that the key space size is 10180. The key acquisition is closely related to the plaintext, which makes the ciphertext more random and resistant to differential attacks, and ensures that the ciphertext is more secure after encryption. The experiments show that the algorithm can encrypt the image effectively and can resist attack on the encrypted image.