This document presents a digital image encryption technique based on a compound sine and cosine chaotic map. The map is used to generate random bits for encryption. The image is first converted to binary and separated into bit planes. Each bit plane is encrypted using XOR operations with bits from the chaotic map. Keys are generated from input ASCII codes which set initial conditions and parameters for the chaotic map, increasing security. Experiments were conducted encrypting color images in MATLAB to evaluate the encryption performance.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This document proposes a novel color image encryption scheme based on multiple chaotic systems. The scheme utilizes the ergodic properties of chaotic systems to perform pixel permutation and applies a substitution operation to achieve diffusion. In the permutation stage, two generalized Arnold maps are used to generate hybrid chaotic sequences to permute pixel positions. In the diffusion stage, four pseudo-random gray value sequences generated by another generalized Arnold map are used to diffuse the permuted image via bitwise XOR operations. Security analysis shows the scheme has a large key space and is highly secure against statistical attacks, differential attacks, and chosen/known plaintext attacks.
Chaos Image Encryption using Pixel shuffling cscpconf
This document proposes a chaos-based image encryption algorithm using pixel shuffling. It uses elements from a chaotic map like the Henon map or Lorentz map to shuffle the pixel positions of an image. The chaotic elements are divided into blocks corresponding to the RGB channels. Pixel positions are reordered according to the sorted indices of each block. Encryption scrambles the pixel positions, while decryption restores the original positions using the same chaotic map. Experimental results on brain and Lena images show the encrypted images have very low correlation with the originals. Slight key changes also result in completely different decryptions, demonstrating key sensitivity of the algorithm.
A new approach of colour image encryption based on henon like chaotic mapAlexander Decker
1. This document presents a new approach for color image encryption based on the Henon-like chaotic map. The algorithm separates the RGB components of an image, encrypts one component using a Henon chaotic map to generate a random bitstream, and then performs a bitwise XOR with the original pixel values of that component.
2. The Henon map is a discrete dynamical system that exhibits chaotic behavior. This property of sensitivity to initial conditions is leveraged to generate encryption keys. The proposed algorithm uses a Henon-like map containing a frequency control parameter to maintain chaotic behavior.
3. Experimental results demonstrate the encryption achieves a uniform distribution of pixel values and differences in histograms between plain and cipher images, indicating the
A new block cipher for image encryption based on multi chaotic systemsTELKOMNIKA JOURNAL
In this paper, a new algorithm for image encryption is proposed based on three chaotic systems which are Chen system,logistic map and two-dimensional (2D) Arnold cat map. First, a permutation scheme is applied to the image, and then shuffled image is partitioned into blocks of pixels. For each block, Chen system is employed for confusion and then logistic map is employed for generating subsititution-box (S-box) to substitute image blocks. The S-box is dynamic, where it is shuffled for each image block using permutation operation. Then, 2D Arnold cat map is used for providing diffusion, after that XORing the result using Chen system to obtain the encrypted image.The high security of proposed algorithm is experimented using histograms, unified average changing intensity (UACI), number of pixels change rate (NPCR), entropy, correlation and keyspace analyses.
Chaotic Block Image Scheme using Large Key Space and Message Digest AlgorithmCSCJournals
In this paper, chaotic block image scheme using large key space and message digest algorithm. Cat map intended for confusion and 2D-Sine Tent Composite map (2D-STCM) key generator intended for diffusion. Confusion is implemented by 2D Cat map with arbitrary block size. In the first tendency, 2D cat map use for local shuffling of indexes inside blocks, while in the second tendency, 2D cat map used for global shuffling of whole image indexes. The designed algorithm executes two confusions and one diffusion in each iteration. To increase the security level, the message digestion algorithm is used as a fingerprint for the plain image that creates the initial value of the key. After that 2D-STCM generates a large key stream. Diffusion implementation takes place by XOR operation; between a key stream and confused image. Experimental results, show that security level increases due to integration of confusion and diffusion. On the other side large key space and the high sensitivity of secret keys have been given a guarantee for the performance of the security. Performance measures reach to the top value among those in the similar researches. To verify the obtained results, authors implemented inverse chaos. All the tests are processed by MATLAB 2015a.
Ieee a secure algorithm for image based information hiding with one-dimension...Akash Rawat
ieee a secure algorithm for image based information hiding with one-dimensional chaotic systems.It used 1 dimensional chaotic system.ieee paper related for image encryption
New Chaotic Substation and Permutation Method for Image Encryptiontayseer Karam alshekly
New Chaotic Substation and Permutation Method for Image Encryption is introduced based on combination between Block Cipher and chaotic map. The new algorithm encrypts and decrypts a block of 500 byte. Each block is firstly permuted by using the hyper-chaotic map and then the result is substituted using 1D Bernoulli map. Finally the resulted block is XORed with the key block. The proposed cipher image subjected to number of tests which are the security analysis (key space analysis and key sensitivity analysis) and statistical attack analysis (histogram, correlation, and differential attack and information entropy) and all results show that the proposed encryption scheme is secure because of its large key space; it’s highly sensitivity to the cipher keys and plain-images.
IRJET- LS Chaotic based Image Encryption System Via Permutation ModelsIRJET Journal
This document proposes an image encryption system using logistic sine map and permutation models. The system works as follows:
1. A plain image is converted to grayscale and decomposed into 8 bit planes.
2. Each bit plane is randomly scrambled.
3. A logistic sine map is used to generate a key to partially encrypt each bit plane.
4. The bits planes are then permuted to obtain the final encrypted image. Logistic sine maps are well-suited for this approach due to their sensitivity to initial parameter values and ability to generate seemingly random outputs. The system aims to increase security by efficiently scrambling and permuting the bit plane values of the input image.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This document proposes a novel color image encryption scheme based on multiple chaotic systems. The scheme utilizes the ergodic properties of chaotic systems to perform pixel permutation and applies a substitution operation to achieve diffusion. In the permutation stage, two generalized Arnold maps are used to generate hybrid chaotic sequences to permute pixel positions. In the diffusion stage, four pseudo-random gray value sequences generated by another generalized Arnold map are used to diffuse the permuted image via bitwise XOR operations. Security analysis shows the scheme has a large key space and is highly secure against statistical attacks, differential attacks, and chosen/known plaintext attacks.
Chaos Image Encryption using Pixel shuffling cscpconf
This document proposes a chaos-based image encryption algorithm using pixel shuffling. It uses elements from a chaotic map like the Henon map or Lorentz map to shuffle the pixel positions of an image. The chaotic elements are divided into blocks corresponding to the RGB channels. Pixel positions are reordered according to the sorted indices of each block. Encryption scrambles the pixel positions, while decryption restores the original positions using the same chaotic map. Experimental results on brain and Lena images show the encrypted images have very low correlation with the originals. Slight key changes also result in completely different decryptions, demonstrating key sensitivity of the algorithm.
A new approach of colour image encryption based on henon like chaotic mapAlexander Decker
1. This document presents a new approach for color image encryption based on the Henon-like chaotic map. The algorithm separates the RGB components of an image, encrypts one component using a Henon chaotic map to generate a random bitstream, and then performs a bitwise XOR with the original pixel values of that component.
2. The Henon map is a discrete dynamical system that exhibits chaotic behavior. This property of sensitivity to initial conditions is leveraged to generate encryption keys. The proposed algorithm uses a Henon-like map containing a frequency control parameter to maintain chaotic behavior.
3. Experimental results demonstrate the encryption achieves a uniform distribution of pixel values and differences in histograms between plain and cipher images, indicating the
A new block cipher for image encryption based on multi chaotic systemsTELKOMNIKA JOURNAL
In this paper, a new algorithm for image encryption is proposed based on three chaotic systems which are Chen system,logistic map and two-dimensional (2D) Arnold cat map. First, a permutation scheme is applied to the image, and then shuffled image is partitioned into blocks of pixels. For each block, Chen system is employed for confusion and then logistic map is employed for generating subsititution-box (S-box) to substitute image blocks. The S-box is dynamic, where it is shuffled for each image block using permutation operation. Then, 2D Arnold cat map is used for providing diffusion, after that XORing the result using Chen system to obtain the encrypted image.The high security of proposed algorithm is experimented using histograms, unified average changing intensity (UACI), number of pixels change rate (NPCR), entropy, correlation and keyspace analyses.
Chaotic Block Image Scheme using Large Key Space and Message Digest AlgorithmCSCJournals
In this paper, chaotic block image scheme using large key space and message digest algorithm. Cat map intended for confusion and 2D-Sine Tent Composite map (2D-STCM) key generator intended for diffusion. Confusion is implemented by 2D Cat map with arbitrary block size. In the first tendency, 2D cat map use for local shuffling of indexes inside blocks, while in the second tendency, 2D cat map used for global shuffling of whole image indexes. The designed algorithm executes two confusions and one diffusion in each iteration. To increase the security level, the message digestion algorithm is used as a fingerprint for the plain image that creates the initial value of the key. After that 2D-STCM generates a large key stream. Diffusion implementation takes place by XOR operation; between a key stream and confused image. Experimental results, show that security level increases due to integration of confusion and diffusion. On the other side large key space and the high sensitivity of secret keys have been given a guarantee for the performance of the security. Performance measures reach to the top value among those in the similar researches. To verify the obtained results, authors implemented inverse chaos. All the tests are processed by MATLAB 2015a.
Ieee a secure algorithm for image based information hiding with one-dimension...Akash Rawat
ieee a secure algorithm for image based information hiding with one-dimensional chaotic systems.It used 1 dimensional chaotic system.ieee paper related for image encryption
New Chaotic Substation and Permutation Method for Image Encryptiontayseer Karam alshekly
New Chaotic Substation and Permutation Method for Image Encryption is introduced based on combination between Block Cipher and chaotic map. The new algorithm encrypts and decrypts a block of 500 byte. Each block is firstly permuted by using the hyper-chaotic map and then the result is substituted using 1D Bernoulli map. Finally the resulted block is XORed with the key block. The proposed cipher image subjected to number of tests which are the security analysis (key space analysis and key sensitivity analysis) and statistical attack analysis (histogram, correlation, and differential attack and information entropy) and all results show that the proposed encryption scheme is secure because of its large key space; it’s highly sensitivity to the cipher keys and plain-images.
IRJET- LS Chaotic based Image Encryption System Via Permutation ModelsIRJET Journal
This document proposes an image encryption system using logistic sine map and permutation models. The system works as follows:
1. A plain image is converted to grayscale and decomposed into 8 bit planes.
2. Each bit plane is randomly scrambled.
3. A logistic sine map is used to generate a key to partially encrypt each bit plane.
4. The bits planes are then permuted to obtain the final encrypted image. Logistic sine maps are well-suited for this approach due to their sensitivity to initial parameter values and ability to generate seemingly random outputs. The system aims to increase security by efficiently scrambling and permuting the bit plane values of the input image.
Design a New Image Encryption using Fuzzy Integral Permutation with Coupled C...IJORCS
This document proposes a new image encryption algorithm combining DNA sequence addition and coupled chaotic maps. The algorithm has two parts: 1) A DNA sequence matrix is obtained by encoding image pixels and divided into blocks that are added using Sugeno fuzzy integral, 2) The modified color components are encrypted using coupled two-dimensional piecewise nonlinear chaotic maps to strengthen security. Experimental results on image databases show the algorithm effectively protects digital image security over the internet.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document discusses video compression using the Set Partitioning in Hierarchical Trees (SPIHT) algorithm and neural networks. It presents the principles of SPIHT coding and the backpropagation algorithm for neural networks. Various neural network training algorithms are tested for compressing video frames, including gradient descent with momentum and adaptive learning. The results show the compressed frames with different algorithms, and gradient descent with momentum and adaptive learning achieved the best compression ratio of 1.1737089:1 while maintaining image clarity.
A New Chaos Based Image Encryption and Decryption using a Hash FunctionIRJET Journal
This document proposes a new chaos-based image encryption and decryption scheme using Arnold's cat map for pixel permutation and the Lorenz system for diffusion. A hash function, specifically MurmurHash3, is used to generate the permutation and diffusion keys. This helps accelerate the diffusion process and reduces the number of cipher cycles needed compared to previous schemes. The encryption process involves first permuting the pixel positions using the cat map, with control parameters determined by the hash value of the original image. Then diffusion is performed using the Lorenz system to generate the keystream. Decryption follows the reverse process using the same keys. Security analysis demonstrates the scheme has a large key space and the encrypted images pass various statistical tests, indicating the
The document proposes and evaluates a new digital image security scheme that uses Residue Number System (RNS) encoding/decoding and a modified Arnold transform algorithm. Key points:
- The encryption process encodes the plain image into residual images using RNS, then encrypts them by applying the modified Arnold transform multiple times.
- The decryption process decrypts the cipher image by applying the inverse Arnold transform, then decodes the residual images back into the plain image using RNS and the Chinese Remainder Theorem.
- Experimental results on images of different sizes show the scheme can encrypt/decrypt without information loss. Security analysis indicates resistance to statistical attacks like histograms and strong sensitivity to encryption keys.
This document proposes a new digital image encryption technique based on multi-scroll chaotic delay differential equations (DDEs). The technique uses a XOR operation between separated binary planes of a grayscale image and a shuffled attractor image from a DDE. Security keys include DDE parameters like initial conditions, time constants, and simulation time. Experimental results using a 512x512 Lena image in MATLAB demonstrate the DDE dynamics, encryption/decryption security through histograms, power spectrums, and image correlations. Wrong key decryption is also shown. The technique offers potential for simple yet secure image transmission applications.
Chaos Image Encryption Methods: A Survey StudyjournalBEEI
This document surveys various chaos encryption techniques for encrypting image data. It begins by explaining why traditional encryption techniques are unsuitable for images and how chaos encryption provides an effective solution. It then provides background on chaos theory and describes the general process of chaos-based image encryption. The document proceeds to summarize several specific chaos encryption algorithms proposed in other papers, evaluating aspects like key space, correlation coefficient, and resistance to attacks. It concludes that chaos encryption is an effective method for secure image encryption and multiple techniques can be combined to further increase security.
Slide for study session given by Ryosuke Sasaki at Arithmer inc.
It is a summary of recent methods for object pose estimation in robotics using deep learning.
He entered Ph.D course at Univ. of Tokyo in April 2020.
Arithmer株式会社は東京大学大学院数理科学研究科発の数学の会社です。私達は現代数学を応用して、様々な分野のソリューションに、新しい高度AIシステムを導入しています。AIをいかに上手に使って仕事を効率化するか、そして人々の役に立つ結果を生み出すのか、それを考えるのが私たちの仕事です。
Arithmer began at the University of Tokyo Graduate School of Mathematical Sciences. Today, our research of modern mathematics and AI systems has the capability of providing solutions when dealing with tough complex issues. At Arithmer we believe it is our job to realize the functions of AI through improving work efficiency and producing more useful results for society.
The document summarizes a proposed user-friendly image sharing scheme that uses JPEG-LS prediction and LSB matching functions. The scheme encodes a secret image into meaningful shadow images using different prime numbers for different blocks, as determined by JPEG-LS prediction. It hides the prime number indicators in the least significant bits of pixels using LSB matching to prevent image degradation. The experimental results showed the reconstructed image quality was higher than previous schemes, making it suitable for applications requiring high quality images like medicine, military, or art.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document proposes a new image encryption scheme based on chaotic encryption. It provides a fast encryption algorithm using a pseudorandom key stream generator based on coupled chaotic maps. Only the most important image components identified using discrete wavelet transform are encrypted. Statistical analysis shows the encrypted images have uniform histograms and negligible pixel correlations, resisting cryptanalysis attacks. The partial encryption also reduces computation time for applications with bandwidth and power constraints like mobile devices.
A FRACTAL BASED IMAGE CIPHER USING KNUTH SHUFFLE METHOD AND DYNAMIC DIFFUSIONIJCNCJournal
This paper proposes a fractal-based image encryption algorithm which follows permutation-substitution structure to maintain confusion and diffusion properties. The scheme consists of three phases: key generation process; pixel permutation using the Knuth shuffle method; and the dynamic diffusion of scrambled image. A burning ship fractal function is employed to generate a secret key sequence which is further scanned using the Hilbert transformation method to increase the randomness. The chaotic behavior of the fractal strengthens the key sensitivity towards its initial condition. In the permutation phase, the Knuth shuffle method is applied to a noisy plain image to change the index value of each pixel. To substitute the pixel values, a dynamic diffusion is suggested in which each scrambled pixel change its value by using the current key pixel and the previously ciphered image pixel. To enhance the security of the cryptosystem, the secret key is also modified at each encryption step by performing algebraic transformations. The visual and numerical analysis demonstrates that the proposed scheme is reliable to secure transmission of gray as well as color images.
AN ENHANCED SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES USING SIDE M...Editor IJMTER
This paper proposes a scheme for Enhanced Separable Reversible Data Hiding in
Encrypted images Using Side Match. In the first step the original image is encrypted using an
encryption key. Then additional data is embedded into the image by modifying a small portion of the
encrypted image using a data hiding key. With an encrypted image containing additional data, if a
receiver has the data hiding key, he can extract the additional data. If the receiver has the encryption
key, he can decrypt the image, but cannot extract the additional data. If the receiver has both the data
hiding key and encryption key, he can extract the additional data and recover the original content by
exploiting the spatial correlation in natural images. The accuracy of data extraction is improved by
using a better scheme for measuring the smoothness of the received image, and uses the Side Match
scheme to further decrease the error rate of extracted bits.
Aes cryptography algorithm based on intelligent blum blum-shub prn gs publica...zaidinvisible
This document summarizes a study that proposes enhancing the Advanced Encryption Standard (AES) algorithm by using an intelligent Blum-Blum-Shub (BBS) pseudo-random number generator to generate the initial encryption key. The AES algorithm is described along with its standard steps of sub-bytes, shift rows, mix columns, and add round key. Issues with the security of AES's public key are discussed. The study then introduces BBS and Iterated Local Search (ILS) metaheuristics and describes how combining them can generate strong cryptographic keys. An example is provided to demonstrate encrypting a message with the enhanced AES approach using an intelligent BBS-generated key. The study concludes the method increases encryption efficiency and
A CHAOTIC CONFUSION-DIFFUSION IMAGE ENCRYPTION BASED ON HENON MAPIJNSA Journal
This paper suggests chaotic confusion-diffusion image encryption based on the Henon map. The proposed chaotic confusion-diffusion image encryption utilizes image confusion and pixel diffusion in two levels. In the first level, the plainimage is scrambled by a modified Henon map for n rounds. In the second level, the scrambled image is diffused using Henon chaotic map. Comparison between the logistic map and modified Henon map is established to investigate the effectiveness of the suggested chaotic confusion-diffusion image encryption scheme. Experimental results showed that the suggested chaotic confusion-diffusion image encryption scheme can successfully encrypt/decrypt images using the same secret keys. Simulation results confirmed that the ciphered images have good entropy information and low correlation between coefficients. Besides the distribution of the gray values in the ciphered image has random-like behavior.
Slides for a talk about Graph Neural Networks architectures, overview taken from very good paper by Zonghan Wu et al. (https://arxiv.org/pdf/1901.00596.pdf)
DETECTION OF DENSE, OVERLAPPING, GEOMETRIC OBJECTSijaia
Using a unique data collection, we are able to study the detection of dense geometric objects in image data where object density, clarity, and size vary. The data is a large set of black and white images of scatterplots, taken from journals reporting thermophysical property data of metal systems, whose plot points are represented primarily by circles, triangles, and squares. We built a highly accurate single class U-Net convolutional neural network model to identify 97 % of image objects in a defined set of test images, locating the centers of the objects to within a few pixels of the correct locations. We found an optimal way in which to mark our training data masks to achieve this level of accuracy. The optimal markings for object classification, however, required more information in the masks to identify particular types of geometries. We show a range of different patterns used to mark the training data masks, and how they help or hurt our dual goals of location and classification. Altering the annotations in the segmentation masks can increase both the accuracy of object classification and localization on the plots, more than other factors such as
adding loss terms to the network calculations. However, localization of the plot points and classification of the geometric objects require different optimal training data.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
Enhancement and Analysis of Chaotic Image Encryption Algorithms cscpconf
The focus of this paper is to improve the level of security and secrecy provided by the chaotic
map based image encryption.An encryption algorithm based on the Logistic and the Henon
maps is proposed. The algorithm uses chaotic iteration to generate the encryption keys, and
then carries out the XOR and cyclic shift operations on the plain text to change the values of
image pixels. Chaotic Map Lattice based image encryption algorithm suggested by Pisarchik is
also examined which is based on Logistic map alone. In experiments, the corresponding results
showed the proposed method is a promising scheme for image encryption in terms of security
and secrecy. At the end, we show the results of a security analysis and a comparison of both
schemes
11.secure compressed image transmission using self organizing feature mapsAlexander Decker
This document summarizes a research paper that proposes a method for secure compressed image transmission using self-organizing feature maps. The method involves compressing images using SOFM-based vector quantization, entropy coding the results, and encrypting the compressed data using a scrambler before transmission. Simulation results show the method achieves a compression ratio of up to 38:1 while providing security, outperforming JPEG compression by up to 1 dB. The paper presents the technical details and evaluation of the proposed secure image transmission system.
A novel technique for speech encryption based on k-means clustering and quant...journalBEEI
This document proposes a new algorithm for speech encryption that uses quantum chaotic maps, k-means clustering, and two stages of scrambling. The first stage uses a tent map to scramble bits in the binary representation of the signal. The second stage uses k-means clustering to scramble blocks of the signal. A quantum logistic map is used to generate an encryption key. The proposed method is evaluated using statistical quality metrics and is shown to provide secure and efficient speech encryption while maintaining high quality of recovered speech.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
Design a New Image Encryption using Fuzzy Integral Permutation with Coupled C...IJORCS
This document proposes a new image encryption algorithm combining DNA sequence addition and coupled chaotic maps. The algorithm has two parts: 1) A DNA sequence matrix is obtained by encoding image pixels and divided into blocks that are added using Sugeno fuzzy integral, 2) The modified color components are encrypted using coupled two-dimensional piecewise nonlinear chaotic maps to strengthen security. Experimental results on image databases show the algorithm effectively protects digital image security over the internet.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document discusses video compression using the Set Partitioning in Hierarchical Trees (SPIHT) algorithm and neural networks. It presents the principles of SPIHT coding and the backpropagation algorithm for neural networks. Various neural network training algorithms are tested for compressing video frames, including gradient descent with momentum and adaptive learning. The results show the compressed frames with different algorithms, and gradient descent with momentum and adaptive learning achieved the best compression ratio of 1.1737089:1 while maintaining image clarity.
A New Chaos Based Image Encryption and Decryption using a Hash FunctionIRJET Journal
This document proposes a new chaos-based image encryption and decryption scheme using Arnold's cat map for pixel permutation and the Lorenz system for diffusion. A hash function, specifically MurmurHash3, is used to generate the permutation and diffusion keys. This helps accelerate the diffusion process and reduces the number of cipher cycles needed compared to previous schemes. The encryption process involves first permuting the pixel positions using the cat map, with control parameters determined by the hash value of the original image. Then diffusion is performed using the Lorenz system to generate the keystream. Decryption follows the reverse process using the same keys. Security analysis demonstrates the scheme has a large key space and the encrypted images pass various statistical tests, indicating the
The document proposes and evaluates a new digital image security scheme that uses Residue Number System (RNS) encoding/decoding and a modified Arnold transform algorithm. Key points:
- The encryption process encodes the plain image into residual images using RNS, then encrypts them by applying the modified Arnold transform multiple times.
- The decryption process decrypts the cipher image by applying the inverse Arnold transform, then decodes the residual images back into the plain image using RNS and the Chinese Remainder Theorem.
- Experimental results on images of different sizes show the scheme can encrypt/decrypt without information loss. Security analysis indicates resistance to statistical attacks like histograms and strong sensitivity to encryption keys.
This document proposes a new digital image encryption technique based on multi-scroll chaotic delay differential equations (DDEs). The technique uses a XOR operation between separated binary planes of a grayscale image and a shuffled attractor image from a DDE. Security keys include DDE parameters like initial conditions, time constants, and simulation time. Experimental results using a 512x512 Lena image in MATLAB demonstrate the DDE dynamics, encryption/decryption security through histograms, power spectrums, and image correlations. Wrong key decryption is also shown. The technique offers potential for simple yet secure image transmission applications.
Chaos Image Encryption Methods: A Survey StudyjournalBEEI
This document surveys various chaos encryption techniques for encrypting image data. It begins by explaining why traditional encryption techniques are unsuitable for images and how chaos encryption provides an effective solution. It then provides background on chaos theory and describes the general process of chaos-based image encryption. The document proceeds to summarize several specific chaos encryption algorithms proposed in other papers, evaluating aspects like key space, correlation coefficient, and resistance to attacks. It concludes that chaos encryption is an effective method for secure image encryption and multiple techniques can be combined to further increase security.
Slide for study session given by Ryosuke Sasaki at Arithmer inc.
It is a summary of recent methods for object pose estimation in robotics using deep learning.
He entered Ph.D course at Univ. of Tokyo in April 2020.
Arithmer株式会社は東京大学大学院数理科学研究科発の数学の会社です。私達は現代数学を応用して、様々な分野のソリューションに、新しい高度AIシステムを導入しています。AIをいかに上手に使って仕事を効率化するか、そして人々の役に立つ結果を生み出すのか、それを考えるのが私たちの仕事です。
Arithmer began at the University of Tokyo Graduate School of Mathematical Sciences. Today, our research of modern mathematics and AI systems has the capability of providing solutions when dealing with tough complex issues. At Arithmer we believe it is our job to realize the functions of AI through improving work efficiency and producing more useful results for society.
The document summarizes a proposed user-friendly image sharing scheme that uses JPEG-LS prediction and LSB matching functions. The scheme encodes a secret image into meaningful shadow images using different prime numbers for different blocks, as determined by JPEG-LS prediction. It hides the prime number indicators in the least significant bits of pixels using LSB matching to prevent image degradation. The experimental results showed the reconstructed image quality was higher than previous schemes, making it suitable for applications requiring high quality images like medicine, military, or art.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document proposes a new image encryption scheme based on chaotic encryption. It provides a fast encryption algorithm using a pseudorandom key stream generator based on coupled chaotic maps. Only the most important image components identified using discrete wavelet transform are encrypted. Statistical analysis shows the encrypted images have uniform histograms and negligible pixel correlations, resisting cryptanalysis attacks. The partial encryption also reduces computation time for applications with bandwidth and power constraints like mobile devices.
A FRACTAL BASED IMAGE CIPHER USING KNUTH SHUFFLE METHOD AND DYNAMIC DIFFUSIONIJCNCJournal
This paper proposes a fractal-based image encryption algorithm which follows permutation-substitution structure to maintain confusion and diffusion properties. The scheme consists of three phases: key generation process; pixel permutation using the Knuth shuffle method; and the dynamic diffusion of scrambled image. A burning ship fractal function is employed to generate a secret key sequence which is further scanned using the Hilbert transformation method to increase the randomness. The chaotic behavior of the fractal strengthens the key sensitivity towards its initial condition. In the permutation phase, the Knuth shuffle method is applied to a noisy plain image to change the index value of each pixel. To substitute the pixel values, a dynamic diffusion is suggested in which each scrambled pixel change its value by using the current key pixel and the previously ciphered image pixel. To enhance the security of the cryptosystem, the secret key is also modified at each encryption step by performing algebraic transformations. The visual and numerical analysis demonstrates that the proposed scheme is reliable to secure transmission of gray as well as color images.
AN ENHANCED SEPARABLE REVERSIBLE DATA HIDING IN ENCRYPTED IMAGES USING SIDE M...Editor IJMTER
This paper proposes a scheme for Enhanced Separable Reversible Data Hiding in
Encrypted images Using Side Match. In the first step the original image is encrypted using an
encryption key. Then additional data is embedded into the image by modifying a small portion of the
encrypted image using a data hiding key. With an encrypted image containing additional data, if a
receiver has the data hiding key, he can extract the additional data. If the receiver has the encryption
key, he can decrypt the image, but cannot extract the additional data. If the receiver has both the data
hiding key and encryption key, he can extract the additional data and recover the original content by
exploiting the spatial correlation in natural images. The accuracy of data extraction is improved by
using a better scheme for measuring the smoothness of the received image, and uses the Side Match
scheme to further decrease the error rate of extracted bits.
Aes cryptography algorithm based on intelligent blum blum-shub prn gs publica...zaidinvisible
This document summarizes a study that proposes enhancing the Advanced Encryption Standard (AES) algorithm by using an intelligent Blum-Blum-Shub (BBS) pseudo-random number generator to generate the initial encryption key. The AES algorithm is described along with its standard steps of sub-bytes, shift rows, mix columns, and add round key. Issues with the security of AES's public key are discussed. The study then introduces BBS and Iterated Local Search (ILS) metaheuristics and describes how combining them can generate strong cryptographic keys. An example is provided to demonstrate encrypting a message with the enhanced AES approach using an intelligent BBS-generated key. The study concludes the method increases encryption efficiency and
A CHAOTIC CONFUSION-DIFFUSION IMAGE ENCRYPTION BASED ON HENON MAPIJNSA Journal
This paper suggests chaotic confusion-diffusion image encryption based on the Henon map. The proposed chaotic confusion-diffusion image encryption utilizes image confusion and pixel diffusion in two levels. In the first level, the plainimage is scrambled by a modified Henon map for n rounds. In the second level, the scrambled image is diffused using Henon chaotic map. Comparison between the logistic map and modified Henon map is established to investigate the effectiveness of the suggested chaotic confusion-diffusion image encryption scheme. Experimental results showed that the suggested chaotic confusion-diffusion image encryption scheme can successfully encrypt/decrypt images using the same secret keys. Simulation results confirmed that the ciphered images have good entropy information and low correlation between coefficients. Besides the distribution of the gray values in the ciphered image has random-like behavior.
Slides for a talk about Graph Neural Networks architectures, overview taken from very good paper by Zonghan Wu et al. (https://arxiv.org/pdf/1901.00596.pdf)
DETECTION OF DENSE, OVERLAPPING, GEOMETRIC OBJECTSijaia
Using a unique data collection, we are able to study the detection of dense geometric objects in image data where object density, clarity, and size vary. The data is a large set of black and white images of scatterplots, taken from journals reporting thermophysical property data of metal systems, whose plot points are represented primarily by circles, triangles, and squares. We built a highly accurate single class U-Net convolutional neural network model to identify 97 % of image objects in a defined set of test images, locating the centers of the objects to within a few pixels of the correct locations. We found an optimal way in which to mark our training data masks to achieve this level of accuracy. The optimal markings for object classification, however, required more information in the masks to identify particular types of geometries. We show a range of different patterns used to mark the training data masks, and how they help or hurt our dual goals of location and classification. Altering the annotations in the segmentation masks can increase both the accuracy of object classification and localization on the plots, more than other factors such as
adding loss terms to the network calculations. However, localization of the plot points and classification of the geometric objects require different optimal training data.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by
another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis
etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its
large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
COLOR IMAGE ENCRYPTION BASED ON MULTIPLE CHAOTIC SYSTEMSIJNSA Journal
This paper proposed a novel color image encryption scheme based on multiple chaotic systems. The ergodicity property of chaotic system is utilized to perform the permutation process; a substitution
operation is applied to achieve the diffusion effect. In permutation stage, the 3D color plain-image matrix
is converted to a 2D image matrix, then two generalized Arnold maps are employed to generate hybrid chaotic sequences which are dependent on the plain-image’s content. The generated chaotic sequences are then applied to perform the permutation process. The encryption’s key streams not only depend on the
cipher keys but also depend on plain-image and therefore can resist chosen-plaintext attack as well as
known-plaintext attack. In the diffusion stage, four pseudo-random gray value sequences are generated by another generalized Arnold map. The gray value sequences are applied to perform the diffusion process by bitxoring operation with the permuted image row-by-row or column-by-column to improve the encryption rate. The security and performance analysis have been performed, including key space analysis, histogram analysis, correlation analysis, information entropy analysis, key sensitivity analysis, differential analysis etc. The experimental results show that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-substitution operation, and therefore it is suitable for practical image and video encryption.
Enhancement and Analysis of Chaotic Image Encryption Algorithms cscpconf
The focus of this paper is to improve the level of security and secrecy provided by the chaotic
map based image encryption.An encryption algorithm based on the Logistic and the Henon
maps is proposed. The algorithm uses chaotic iteration to generate the encryption keys, and
then carries out the XOR and cyclic shift operations on the plain text to change the values of
image pixels. Chaotic Map Lattice based image encryption algorithm suggested by Pisarchik is
also examined which is based on Logistic map alone. In experiments, the corresponding results
showed the proposed method is a promising scheme for image encryption in terms of security
and secrecy. At the end, we show the results of a security analysis and a comparison of both
schemes
11.secure compressed image transmission using self organizing feature mapsAlexander Decker
This document summarizes a research paper that proposes a method for secure compressed image transmission using self-organizing feature maps. The method involves compressing images using SOFM-based vector quantization, entropy coding the results, and encrypting the compressed data using a scrambler before transmission. Simulation results show the method achieves a compression ratio of up to 38:1 while providing security, outperforming JPEG compression by up to 1 dB. The paper presents the technical details and evaluation of the proposed secure image transmission system.
A novel technique for speech encryption based on k-means clustering and quant...journalBEEI
This document proposes a new algorithm for speech encryption that uses quantum chaotic maps, k-means clustering, and two stages of scrambling. The first stage uses a tent map to scramble bits in the binary representation of the signal. The second stage uses k-means clustering to scramble blocks of the signal. A quantum logistic map is used to generate an encryption key. The proposed method is evaluated using statistical quality metrics and is shown to provide secure and efficient speech encryption while maintaining high quality of recovered speech.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
This document describes an image encryption and decryption technique using chaos algorithms. It uses the chaotic properties of the Henon map and Arnold cat map. The Henon map is used to generate pseudo-random key values for pixel shuffling. Pixel positions of the input image are first shuffled using the Arnold cat map. Then they are shuffled again using the sorted key values from the Henon map. This encrypts the image. Decryption reverses the process to recover the original pixel values and image. Experimental results show the encrypted image is secure and the original image can be recovered accurately using the correct key during decryption. The technique provides efficient and secure encryption of images for transmission.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A new four-dimensional hyper-chaotic system for image encryption IJECEIAES
Currently, images are very important with the rapid growth of communication networks. Therefore, image encryption is a process to provide security for private information and prevent unwanted access to sensitive data by unauthorized individuals. Chaos systems provide an important role for key generation, with high randomization properties and accurate performance. In this study, a new four-dimensional hyper-chaotic system has been suggested that is used in the keys generation, which are utilized in the image encryption process to achieve permutation and substitution operations. Firstly, color bands are permuted using the index of the chaotic sequences to remove the high correlation among neighboring pixels. Secondly, dynamic S-boxes achieve the principle of substitution, which are utilized to diffuse the pixel values of the color image. The efficiency of the proposed method is tested by the key space, histogram, and so on. Security analysis shows that the proposed method for encrypting images is secure and resistant to different attacks. It contains a big key space of (2627) and a high sensitivity to a slight change in the secret key, a fairly uniform histogram, and entropy values nearby to the best value of 8. Moreover, it consumes a very short time for encryption and decryption.
This document presents a digital medical image cryptosystem based on an infinite-dimensional multi-scroll chaotic delay differential equation (DDE) for secure telemedicine applications. The cryptosystem performs an XOR operation between separated image planes and a shuffled chaotic attractor image from the DDE. The security keys are the initial condition and time constant in the DDE. The document analyzes the nonlinear dynamics of the DDE, including equilibrium points, waveforms, and a 3-scroll attractor. It evaluates the encryption and decryption of CT scan images using histograms, spectral density, key sensitivity, and correlation to demonstrate the cryptosystem's security.
The key is the important part at any security system because it determines whether the system is strength or weakness. This paper aimed to proposed new way to generate keystream based on a combination between 3D Henoun map and 3D Cat map. The principle of the method consists in generating random numbers by using 3D Henon map and these numbers will transform to binary sequence. These sequence positions is permuted and Xoredusing 3D Cat map. The new key stream generator has successfully passed theNIST statistical test suite. The security analysisshows that it has large key space and its very sensitive initial conditions.
A new text encryption algorithm which is based upon a combination between Self-Synchronizing Stream Cipher and chaotic map has been proposed in this paper. The new algorithm encrypts and decrypts text files of different sizes. First of all, the corresponding ASCII values of the plain text are served as input to the permutation operation which diffuses the positions of these values by using hyper-chaotic map. Secondly, the result values are input to substitution operation via1D Bernoulli map. Finally, the resultant vales are XOR feedback with the key.The proposed algorithm has been analyzed using a number of tests and the results show that it has large key space, a uniform histogram, low correlation and it is very sensitive to any change in the plain text or key.
Hybrid chaos-based image encryption algorithm using Chebyshev chaotic map wit...IJECEIAES
The media content shared on the internet has increased tremendously nowadays. The streaming service has major role in contributing to internet traffic all over the world. As the major content shared are in the form of images and rapid increase in computing power a better and complex encryption standard is needed to protect this data from being leaked to unauthorized person. Our proposed system makes use of chaotic maps, deoxyribonucleic acid (DNA) coding and ribonucleic acid (RNA) coding technique to encrypt the image. As videos are nothing but collection of images played at the rate of minimum 30 frames/images per second, this methodology can also be used to encrypt videos. The complexity and dynamic nature of chaotic systems makes decryption of content by unauthorized personal difficult. The hybrid usage of chaotic systems along with DNA and RNA sequencing improves the encryption efficiency of the algorithm and also makes it possible to decrypt the images at the same time without consuming too much of computation power.
IRJET- An Image Cryptography using Henon Map and Arnold Cat MapIRJET Journal
The document proposes a new symmetric image encryption algorithm based on the Henon chaotic system and Arnold Cat map. The algorithm uses Henon map to generate pseudo-random key values for pixel encryption and Arnold Cat map for pixel shuffling. Encryption involves XORing pixel values with keys and shuffling pixels, while decryption reverses these processes to recover the original image using the same keys.
Color Image Encryption and Decryption Using Multiple Chaotic MapsIJTET Journal
Owing to advances in communication technology, a bulk of visual digital data is being stored and transmitted over the internet now-a-days. Particularly millions and millions of images transfer through the network per day as per the statistics and a result, the security of image data is an important requirement. Image encryption algorithm is used to provide this security. In this paper, an image encryption algorithm based on confusion diffusion architecture that uses dynamic key space is proposed. An internal key generator is used to generate the initial seeds for the overall encryption scheme is proposed. With these initial seeds logistic map generates pseudo random numbers then these numbers are converted into permutation order for permutation. The diffusion bits are generated in parallel using the logistic map and manipulated with pixels confused. The image pixels are iteratively confused and diffused using permutation order and diffusion bits respectively to produce cipher image in minimum number of rounds. This paper proposes a new kind of initial seed generation that utilizes the combo of logistic and tent maps. Even all external seeds are same. The internal seeds will be totally different. This ensures the key sensitivity. The simulation results and analysis confirm that the satisfactory level of security is achieved in three rounds and overall encryption time is saved.
Robust Watermarking Technique using 2D Logistic Map and Elliptic Curve Crypto...idescitation
Copyright protection is a vital issue in modern day’s data transmission over
internet. For copyright protection, watermarking technique is extensively used. In this
paper, we have proposed a robust watermarking scheme using 2D Logistic map and elliptic
curve cryptosystem (ECC) in the DWT domain. The combined encryption has been taken to
enhance the security of the watermark before the embedding phase. The PSNR value shows
the difference between original cover and embedded cover is minimal. Similarly, NC values
show the robustness and resistance capability of the proposed technique from the common
attacks such as scaling, Gaussian noise etc. Thus, this combined version of 2D Logistic map
and Elliptic curve cryptosystem can be used in case of higher security requirement of the
watermark signal.
IMAGE ENCRYPTION BASED ON DIFFUSION AND MULTIPLE CHAOTIC MAPSIJNSA Journal
This document proposes an image encryption algorithm that uses diffusion and multiple chaotic maps. It begins by generating subkeys using chaotic logistic maps. The image is then encrypted using one subkey via logistic map transformation, diffusing the image. Additional subkeys are generated from four chaotic maps by hopping through various map orbits. The image is treated as a 1D array via raster and zigzag scanning, divided into blocks, and those blocks undergo position permutation and value transformation controlled by the chaotic subkeys, fully encrypting the image. Decryption reverses the process using the same subkeys.
Multiple Dimensional Fault Tolerant Schemes for Crypto Stream CiphersIJNSA Journal
This document proposes two fault tolerant schemes for stream ciphers based on Algorithm Based Fault Tolerance (ABFT). The first is a 2-D mesh ABFT scheme that can detect and correct any single error in an n-by-n plaintext matrix with linear computation and bandwidth overhead. It constructs matrices for the plaintext, keystream, and transmitted data with row and column checksums. The second is a 3-D mesh-knight ABFT scheme that can detect and correct up to three errors by adding an extra "knight" checksum dimension. Both schemes use only XOR operations and allow errors to be efficiently located and recovered.
Multiple Dimensional Fault Tolerant Schemes for Crypto Stream CiphersIJNSA Journal
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D meshknight ABFT scheme is capable of detecting and correcting up to three errors in an n2 -data matrix with liner computation and bandwidth overhead. The proposed schemes provide one-to-one mapping between data index and check sum group so that error can be located and recovered by easier logic and simple operations.
Chaotic systems with pseudorandom number generate to protect the transmitted...nooriasukmaningtyas
Communication techniques have witnessed rapid development in recent years, especially the internet and the mobile network, which led to rapid data transmission. The latest developments, in turn, have come out with advanced decisions to secure information from eavesdropping. Myriad in-depth studies in cryptography. It was implemented with the intention of proposing a revolutionary solution to protect data by encryption techniques, tend maps, and logistics. This work had proposed a new design to the generator of pseudo-random numbers (GPRN) which had utilized multi chaotic systems. Synchronization of Multi-parameters chaotic arises in many applications, in natural or industrial systems. Many methods have been introduced for using a chaotic system in the encryption of data. Analysis of security of chaotic system had been executed on key sensitivity and key space.
Chaotic systems with pseudorandom number generate to protect the transmitted...
Journal_ICACT
1.
Abstract—this paper presents a digital image cryptosystem
based on nonlinear dynamics of a compound sine and cosine
chaotic map. The compound sine and cosine chaotic map is
proposed for high-degree of chaos over most regions of parameter
spaces in order to increase high-entropy random-bit sources.
Image diffusion is performed through pixel shuffling and bit-plane
separations prior to XOR operations in order to achieve a fast
encryption process. Security key conversions from ASCII code to
floating number for use as initial conditions and control
parameters are also presented in order to enhance key-space and
key-sensitivity performances. Experiments have been performed
in MATLAB using standard color images. Nonlinear dynamics of
the chaotic maps were initially investigated in terms of Cobweb
map, chaotic attractor, Lyapunov exponent spectrum, bifurcation
diagram, and 2-dimensional parameter spaces. Encryption
qualitative performances are evaluated through pixel density
histograms, 2-dimensional power spectral density, key space
analysis, key sensitivity, vertical, horizontal, and diagonal
correlation plots. Encryption quantitative performances are
evaluated through correlation coefficients, NPCR and UACI.
Demonstrations of wrong-key decrypted image are also included.
Keyword— Digital Image Processing, Cryptosystem, Chaotic
Map, Encryption, Decryption, Nonlinear Dynamics
Manuscript received March 7, 2013. This work was
financially supported by Research and Academic Services
Division, Thai-Nichi Institute of Technology.
Sarun Maksuanpan is with computer engineering program,
Faculty of Engineering, Thai-Nichi Institute of technology,
Bangkok, Thailand. (E-mail: sarun.maksuanpan@gmail.com).
Tanachard Veerawadtanapong is with Computer Engineering
Program, Faculty of Engineering, Thai-Nichi Institute of
technology, Thailand. (E-mail: tanachad.pong@gmail.com).
Wimol San-Um is with the Intelligent Electronics Systems
Research Laboratory, Faculty of Engineering, Thai-Nichi
Institute of Technology, Bangkok, Thailand, Fax: (+662)
7632700, Tel: (+662) 7632600 Ext. 2926, (E-mail:
wimol@tni.ac.th).
I. INTRODUCTION
ECENT advances in communications have led to great
demand for secured image transmissions for a variety of
applications such as medical, industrial and military
imaging systems. The secured image transmissions greatly
require reliable, fast and robust security systems, and can be
achieved through cryptography, which is a technique of
information privacy protection under hostile conditions [1].
Image cryptography may be classified into two categories, i.e.
(1) pixel value substitution which focuses on the change in pixel
values so that original pixel information cannot be read, and (2)
pixel location scrambling which focuses on the change in pixel
position. Conventional cryptography such as Data Encryption
Standard (DES), International Data Encryption Algorithm
(IDEA), Advanced Encryption Standard (AES), and RSA
algorithm may not be applicable in real-time image encryption
due to large computational time and high computing power,
especially for the images with large data capacity and high
correlation among pixels [2].
Recently, the utilization of chaotic systems has extensively
been suggested as one of a potential alternative cryptography in
secured image transmissions. As compared to those of
conventional encryption algorithms, chaos-based encryptions
are sensitive to initial conditions and parameters whilst
conventional algorithms are sensitive to designated keys.
Furthermore, chaos-based encryptions spread the initial region
over the entire phase space, but cryptographic algorithms
shuffle and diffuse data by rounds of encryption [3]. Therefore,
the security of chaos-based encryptions is defined on real
numbers through mathematical models of nonlinear dynamics
while conventional encryption operations are defined on finite
sets. Such chaos-based encryption aspects consequently offer
high flexibility in encryption design processes and acceptable
privacy due to vast numbers of chaotic system variants and
numerous possible encryption keys.
Chaos-based encryption algorithms are performed in two
stages, i.e. the confusion stage that permutes the image pixels
Robust Digital Image Cryptosystem Based on
Nonlinear Dynamics of Compound Sine and
Cosine Chaotic Maps for Private Data Protection
Sarun Maksuanpan, Tanachard Veerawadtanapong, Wimol San-Um
Intelligent Electronics Systems Research Laboratory
Faculty of Engineering, Thai-Nichi Institute of Technology, Patthanakarn Rd., Suanlaung, Bangkok, Thailand
sarun.maksuanpan@gmail.com, tanachad.p@gmail.com, and wimol@tni.ac.th
R
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 418
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
2. and the diffusion stage that spreads out pixels over the entire
space. Most existing chaos-based encryptions based on such
two-stage operations employ both initial conditions and
control parameters of 1-D, 2-D, and 3-D chaotic maps such as
Baker map [4,5], Arnold cat map [6,7], and Standard map [8, 9]
for secret key generations. Furthermore, the combinations of
two or three different maps have been suggested [10, 11] in
order to achieve higher security levels. Despite the fact that
such maps offer satisfactory security levels, iterations of maps
require specific conditions of chaotic behaviors through a
narrow region of parameters and initial conditions.
Consequently, the use of iteration maps has become typical for
most of proposed ciphers and complicated techniques in pixel
confusion and diffusion are ultimately required.
This paper therefore presents an alternative chaos-based
digital image cryptosystem with three main aspects. First, the
compound sine and cosine chaotic maps, which potentially
offers high-degree of chaos over most regions of parameter
spaces, is proposed through nonlinear dynamics analyses and is
consequently exploited as high-entropy random-bit sources for
encryption. Second, image confusion and diffusion processes
are performed through uncomplicated pixel shuffling and
bit-plane separations prior to XOR operations in order to
achieve a fast encryption process. Last, security key
conversions from ASCII code to floating number for use as
initial conditions and control parameters are also presented in
order to enhance key-space and key-sensitivity performances.
II. PROPOSED ENCRYPTION ALGORITHMS
A category of trigonometric functions, involving sine and
cosine maps, have potentially offered rich dynamic behaviours
as described in a simple forms as [12] xn+1=sin(axn) and
xn+1=cos(bxn) where the constants a and b can be considered as
the parameters associated the frequencies of sine and cosine
functions, respectively. Although such sine and cosine maps
offers relatively high complexity in terms of nonlinear dynamics,
the chaotic regions in the bifurcation diagram is still insufficient
due to periodic characteristics. This paper therefore considers
an enhancement of sine and cosine maps through the
combination between sine and cosine maps, i.e.
)sin()cos( nn1n bxaxx
As will be seen later, such a compound sine and cosine map in
(1) offers high-degree of chaos over most regions of parameter
spaces. As a nature of chaotic maps, the initial conditions and
control parameters can be used as internal security keys that
entirely set the encryption characteristics. The proposed
cryptography technique attempts to achieve
simple-but-highly-secured image encryption and decryption
algorithms in a category of chaos-based cryptosystems. Fig.1
shows the proposed encryption and detection algorithms using
compound sine and cosine maps. Three major procedures are
summarized as follows;
First, the original image is prepared for diffusion. The
original color image with M×N image size is initially converted
into three sets of sub-images with RGB components containing
pixels in grey scale levels. Each sub-image will subsequently be
converted into binary matrix in which each pixel is represented
by 8-bit binary numbers. For example, the pixel p(1,1) contains
the binary number p0-p7. Each pixel will then be separated into
eight planes corresponding to binary bits p0 to p7. As a result,
there are 24 sets of bit plane images represented in matrix forms
with a single binary number in each pixel, which is ready for
further Excusive-OR (XOR) operations.
Second, the input security keys from users which is
represented in ASCII code with arbitrary 16 alphanumeric
characters defined as A=A1A2A3,...,A16 will form two main sets
of ASCII codes, i.e Xm and Ym, for setting the initial conditions
and the control parameters, respectively, where m = 1, 2, 3,...,8
Grayscale Image
512x512 Pixels
8-Bit Binary Number
per Pixel
[p0,p1,p2,…,p7] [p0]
[p1]
1-Bit Binary Number per Pixel
Dec2Bin Separate
[q0]
[q1]
[q7]
[q0,q1,q2,…,q7]
XOR
Imagetobe
encrypted
8-Bit Binary Number
per Pixel
Encrypted
Image
Combine
Bin2Dec
24 Sets of Binary Number
Initial conditions
Parameters
Compound
Sine and
Cosine Maps
3 Sets of RGB Image
1-Bit Binary Number per Pixel
3 Sets of RGB Image 24 Sets of Binary Number
a1
a2
a8
b1
b2
b8
16-CharactersASCII
Codes
Key
Generation
System
Fig. 1. Proposed pncryption algorithms using compound sine and consine
chaotic maps.
TABLE I
SUMMARY OF 16-CHARACTERS INPUT ASCII CODES FOR SETTING INITIAL
CONDITIONS AND CONTROL PARAMETERS
ASCII code Xm for
Setting initial conditions
ASCII code Ym for setting
control parameters
X1 : A1A4A7A10A13A16 Y1 : A1A3A5A7A9A11
X2 : A2A5A8A11A14A1 Y2 : A2A4A6A8A10A12
X3 : A3A6A9A12A15A2 Y3 : A3A5A7A9A11A13
X4 : A4A7A10A13A16A3 Y4 : A4A6A8A10A12A14
X5 : A5A8A11A14A1A4 Y5 : A5A7A9A11A13A15
X6 : A6A9A12A15A2A5 Y6 : A6A8A10A12A14A16
X7 : A7A10A13A16A3A6 Y7 : A7A9A11A13A15A1
X8 : A8A11A14A1A4A7 Y8 : A8A10A12A14A16A2
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 419
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
3. as summarized in Table 1. Such two sets Xm and Ym will be
converted into 48-bit binary representations denoted by BX1 to
BX48 and BY1 to BY48, respectively. The real numbers are
subsequently formed by converting the binary representation as
follows;
4847
48X
1
1X
0
1X 2/)2B...2B2(B XmR
4847
48Y
1
1Y
0
1Y 2/)2B...2B2(B YmR
As a result, the initial conditions and the control parameters can
be achieved by
1mod)( YmXmm RRa
1mod)( 1
YmYmm RRb
It is apparent that the values of am and bm are in the region of
(0,1) and are ready for use as internal security keys in the
encryption algorithms. The design algorithm realizes eight
chaotic maps based on (1) as follows;
)π10sin()π10cos( n1n1nm, xbxbx mm
It is seen in (4) that the constant 10π has been include in order to
sustain the parameters a and b described in (1) in the region of
(0, 10) which is sufficient to acquire chaos. The values of m are
circularly shifted with 1 to 8, i.e. if the operation round reaches
m+1=8 then the next value is 1. As results, a total 16 keys are
employed as security keys in the encryption process. Such keys
are used to generate chaotic signal from the compound sine and
cosine chaotic maps. The output signals are adjusted to the
binary number through the zero thresholds for the subsequent
XOR operations.
Last, the XOR operations diffuse the generated chaotic bit
and the 24 binary images in parallel process. The XOR
operation yields bit “1” if the two input bits are different, but
yields bits “0” if the two inputs are similar. The results obtained
from such XOR operations are 24 matrices with single binary
number in each pixel. All the 24 matrices are combined into
three RGB matrices of a single 8-bit matrix in which each pixel
is represented by [b0-b7]. As a result, the encrypted image can be
achieved. The decryption process also follows the encryption
process in a backward algorithms as long as the security keys
are known. It is seen in (4) that the constant 10π has been
include in order to sustain the parameters a and b described in
(1) in the region of (0, 10) which is sufficient to acquire chaos.
The values of m are circularly shifted with 1 to 8, i.e. if the
operation round reaches m+1=8 then the next value is 1. As
results, a total 16 keys are employed as security keys in the
encryption process. Such keys are used to generate chaotic
signal from the compound sine and cosine chaotic maps. The
output signals are adjusted to the binary number through the
zero thresholds for the subsequent XOR operations.
Last, the XOR operations diffuse the generated chaotic bit
and the 24 binary images in parallel process. The XOR
operation yields bit “1” if the two input bits are different, but
yields bits “0” if the two inputs are similar. The results obtained
from such XOR operations are 24 matrices with single binary
number in each pixel. All the 24 matrices are combined into
Parameter a = (0,10)
Parameterb=(0,10)
Parameter a = (0,1)
Parameterb=(0,1)
(a) (b)
Fig. 2. Plots of 2-D Lyapunov Exponent bifurcation structure between
parameters a and b over the parameter space; (a) (0,10) and (b) the zoomed in
region (0,1).
Chaotic Behaviors : LE>0
Non-chaotic Behaviors : LE<0
LyapunovExponent(LE)IteratedValuesXn
Parameter a
(b) (b)
Fig. 3. Plots of the Lyapunov exponent spectrum and the bifurcation diagram
of parameters a over the parameter space (0,10) when the parameter b is fixed
at 0.5.
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 420
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
4. three RGB matrices of a single 8-bit matrix in which each pixel
is represented by [b0-b7]. As a result, the encrypted image can be
achieved. The decryption process also follows the encryption
process in a backward algorithms as long as the security keys
are known.
III. EXPERIMENTAL RESULTS
Experimental results have been performed in a computer–aid
design tool MATLAB. Nonlinear dynamics of a compound sine
and cosine map was initially simulated and encryption and
decryption security performances were subsequently evaluated.
A. Nonlinear Dynamics of Compound Sine and Cosine Map
Since chaotic behaviors of the compound sine and cosine
maps determine overall performance of the cryptosystem,
Lyapunov exponent (LE) has been realized as a quantitative
measure of chaoticity. The LE is defined as a quantity that
characterizes the rate of separation of infinitesimally close
trajectories and is given by
N
1n n
1n
2
n dX
dX
log
N
1
limLE
where N is the number of iterations. Typically, the positive LE
indicates chaotic behaviors. The larger value of LE results in
higher degree of chaos. Fig.1 shows the plots of 2-imensional
Lyapunov Exponent bifurcation structure between parameters a
and b over the parameter space (0, 10) and the zoomed in region
(0, 1) where the chaotic region is represented by the dark blue
color while the non-chaotic region is represented in the white
region. It is shown in Fig.1 that the chaotic behaviors of the
compound sine and cosine map occupy most of parameter
spaces, leading to a very robust chaos for secret key
generations. Nonetheless, the zoomed in region at small values
of parameters a and b contain some non-chaotic regions, which
represent quasi-chaotic or periodic behaviors. The proposed
key generation system has been designed to potentially
generates secret keys potentially since the nonchaotic signals
will ultimately be LE spectrum and the bifurcation diagram of
parameters a over the parameter space (0, 10) when the
parameter b is fixed at 0.5. It is apparent in Fig.2 that the LE
spectrum is greater than zero and growing to infinity. In
addition, the bifurcation diagram shows dense area of the
maximum values of Xn over the entire range. As for a particular
example, Fig.3 shows the histograms of the numbers of the
secret key a1 for 1,000 iterations. It can be seen from Fig.3 that
the nonlinear dynamics of the compound sine and cosine maps
provide the random secret keys that distribute over the region
(0, 1) randomly. Such characteristics have also found in other
secret keys. The simulations have been ensured that the
proposed compound the nonlinear dynamics of the compound
sine and cosine maps and the key generation systems can
potentially provide truly random values for diffusion process in
the proposed cryptosystem.
B. Key Space Analysis
The encryption and decryption realizes the 16-character
ASCII code “ABCDEFG012345678” as an input key and the
wrong key changes the last character to 5. The resulting eight
initial conditions and eight parameters, i.e. a total of 16 keys,
are represented by 8-digit floating-point numbers. Considering
each key in the form S×2E
where S is a significand and E is an
exponent, the keys that represented by 8 digits of a
floating-point number (~3.4028×1038
) results in 128 uncertain
digits, which is greater than the minimum requirement of the
56-bit data (~7.2057×1016
) encryption standard (DES)
algorithm [23].
C. Histograms and 2D Power Spectral Analysis
The image histogram is a graph that illustrates the number of
pixels in an image at different intensity values. In particular, the
histogram of a color image can be separated into three
sub-images with Red (R), Green (G), and Blue (B) components.
Each sub-image has 256 different grey intensity levels,
graphically displaying 256 numbers with distribution of pixels
amongst these grayscale values. In addition, the 2D power
spectrum that shows the power of image intensity can be
obtained through a Discrete Fourier Transform (DFT) analysis
and the algorithm is given by [24]
))/2(exp())/2(exp(),(),(
1
0
1
0
vyNjuxMjyxfvuF
N
y
M
x
where x and y are a coordinates pair of an image, M and N are
the size of image, f(x, y) is the image value at the pixel (x, y).
Fig.4 shows the histograms of three R, G, B components and 2D
power spectrums of original image, encrypted image, decrypted
image, and decrypted image with wrong keys. As for a
particular demonstration, the original image is Lena image with
256×256 image size. It can be seen from Figs.4 that the
intensities of all original images in the histogram are
contributed with different values in a particular shape and the
power spectrum is not flat having a peak of intensity in the
Numberoftheinitialconditiona1
Values of the initial condition a1
N=1000 iterations
(c) (b)
Fig. 4. Histrogram of numbers of initial conditions a1.
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 421
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
5. OriginalImage
Histograms of RED
Component of Images
EncryptionCorrectKey
Decryption
WrongKey
Decryption
Images Histograms of GREEN
Component of Images
Histograms of BLUE
Component of Images
2D Power Spectrum of
Images
Fig.5. Histograms and 2D power spectrums of original image, encrypted image, decrypted image, and decrypted image with wrong keys.
Pixelvalueson(x+1,y)
Pixelvalueson(x,y+1)
Pixelvalueson(x+1,y+1)
Pixel values on (x,y)
Pixelvalueson(x+1,y)
Pixelvalueson(x,y+1)
Pixelvalueson(x+1,y+1)
Pixel values on (x,y)Pixel values on (x,y)
Fig.6. Image correlation tests in original and encrypted images, including horizontally, vertically, and diagonally adjacent pixels.
middle. The encrypted image has a flat histogram and power
spectrum, indicating that the intensity values are equally
contributed over all the intensity range and the original images
are completely diffused and invisible. The decrypted images
with right keys provide similar characteristics of the original
images while the decrypted images with wrong keys are still
diffused and the original images cannot be seen. These results
qualitatively guarantee that the image is secured.
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 422
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
6. D. Correlation Coefficient Analysis
In order to quantify the encryption performance and key
sensitivity analysis, correlation between image pairs, which is a
measure of relationships between two pixels intensities of two
images, of the three realized images have been analyzed. The
covariance Cv and the correlation coefficient γxy can be obtained
as follows [16-17];
))(E())(E(
N
1
),(C 1
yyxxyx i
N
i iv
)(D)(D
),cov(
yx
yx
xy
where the functions E(x) and D(x) are expressed as
N
i ixx 1
N
1
)(E and
2
1
))(E(
N
1
)(D
N
i i xxx (11)
and the variables x and y are grey-scale values of pixels in
corresponding pixels in different images or two adjacent pixels
in the same image. Typically, the value of γxy is in the region [-
1, 1]. In other words, the values of γxy in the region (-1,0) and
(0,1) respectively indicate positive and negative relationships,
while the larger number close to 1 or -1 have stronger
relationships. Using a random selection of 2,048 pairs of pixels,
Fig.5 shows image correlation tests in original and encrypted
images, including horizontally, vertically, and diagonally
adjacent pixels. It can qualitatively be considered from Figs.5
that the adjacent pixels of all encrypted images are highly
uncorrelated as depicted by scatters plots of correlations.
For the quantitative measures, the correlations between
pairs of original images and corresponding encrypted images
through the computation of correlation coefficient between
RGB components of the original images and corresponding
encrypted images have been analyzed. Table 2 summarizes
correlation coefficients of 2,048 pixels of each image pair. It
can be seen in Table 3 that the correlation coefficients are very
small closing to zero, indicating that each pair of images are
completely independent of each other. Fig.7 shows the original
and cipher images of five images for the experiments, including
Lena, Jet plane, Brain, Baboon and Peppers images. As for
investigations of other images with different characteristics,
comparisons of correlation coefficients of four standard images
in MATLAB shown in Fig.7 are also studied. Table 3
summarizes correlation coefficients of 2,048 pixels of each pair
of images shown in Fig.7. Apparently, the correlation
coefficients are also very small. These results quantitatively
guarantee that the image is secured.
E. Original Image Sensitivity Analysis
One minor change in the plain image causes significant
changes in the encrypted image then such differential analysis
may become inefficient, and therefore much difference between
encrypted forms is expected in order to maintain high security
level. NPCR (Net Pixel Change Rate) and UACI (Unified
Average Changing Intensity) are two most common measures.
NPCR concentrates on the absolute number of pixels which
changes value in differential attacks while the UACI focuses on
the averaged difference between two paired encrypted images
(a) Lena Image
(b) Jet plane Image
(c) Brain Image
(d) Brain Image
(e) Peppers Image
Fig. 7. Original and cipher images of five images for the experiments.
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 423
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
7. [17]. For the two encrypted images in which the corresponding
original images have only one pixel difference are denoted by C1
and C2
. Label the greyscale values of the pixels at pixel (i,j) in C1
and C2
by C1
(i,j) and C2
(i,j), respectively. Define a bipolar array
D, with the same size as images C1
and C2
. Consequently, D(i,j)
is determined by C1
(i,j) and C2
(i,j), if C1
(i,j) =C2
(i,j) then
D(i,j)=1, otherwise, D(i,j)=0. The NPCR [21] is defined as
%100
),(,
T
jiD
NPCR
ji
(12)
%100
),(,
T
jiD
UACI ji (13)
where T denotes the total number pixels in the encrypted image,
F denotes the largest supported pixel value compatible with the
cipher image format, and |.| denotes the absolute value function.
Table 4 summarizes the values of NPCR and UACI for different
image with the sizes of 256×256. It can be seen that the NPCR
are relatively close to 100% and the UACI are also in the
acceptable region of approximately 33%.
F. Information Entropy Analysis
The entropy H(s) is one of important characteristics of the
randomness and can be found by
12
0
2
)(
1
log)()(
M
i i
i
SP
SPsH (12)
where P(Si) represents the probability of symbols i. In the case
where a purely random source producing 2M symbols, the
entropy is given by H(s)=M. If the output of a cipher image
produces the number of symbols with the entropy value of less
than M, there is a certain degree of predictability which
intimidates its security. Table 5 summarizes the results of
information entropy of those five standard images in Fig.7. The
values obtained are very close to the theoretical value of M=8,
indicating that information leakage during encryption process is
negligible and the encryption system is secure against the
entropy attack.
CONCLUSION
A robust digital image cryptosystem based on nonlinear
dynamics of a compound sine and cosine chaotic map has been
presented. The compound sine and cosine chaotic map has been
proposed for high-degree of chaos over most regions of
parameter spaces in order to increase high-entropy random-bit
sources. Image diffusion has been performed through pixel
shuffling and bit-plane separations prior to XOR operations in
order to achieve a fast encryption process. Security key
conversions from ASCII code to floating number for use as
initial conditions and control parameters were also presented to
enhance key-space and key-sensitivity performances. Nonlinear
dynamics of the chaotic maps have been investigated in terms of
chaotic attractor, Lyapunov exponent spectrum, bifurcation
diagram, and 2-dimensional parameter spaces. Encryption
qualitative performances were evaluated through pixel density
TABLE II
COMPARISONS OF CORRELATION COEFFICIENTS OF LENA IMAGE AT DIFFERENT SIZES.
Image Sizes CRR CRG CRB CGR CGG CGB CBR CBG CBB
256×256 0.00312 0.00298 -0.00406 0.00195 0.00061 -0.00267 0.00052 -0.00061 -0.00419
512×512 -0.00306 -0.00325 -0.00099 -0.00421 -0.00211 -0.00153 -0.00367 -0.00060 -0.00108
1024×1024 0.00181 -0.00081 0.00033 0.00113 -0.00056 -0.00053 0.00077 0.00008 -0.00063
TABLE III
COMPARISONS OF CORRELATION COEFFICIENTS OF DIFFERENT IMAGE WITH 256×256 IMAGE SIZE.
Images CRR CRG CRB CGR CGG CGB CBR CBG CBB
Brain 0.00259 -0.00123 -0.00270 0.00259 -0.00121 -0.00271 0.00261 -0.00128 -0.00269
Mandril -0.00044 0.00735 -0.00606 0.00265 0.00657 -0.00625 0.00340 0.00194 -0.00613
Peppers 0.00429 -0.00456 -0.00240 0.00524 -0.00076 -0.00152 0.00129 -0.00378 -0.00152
Jet Plane -0.00111 -0.00588 -0.00644 -0.00087 -0.00347 -0.00601 -0.00126 -0.00362 -0.00488
TABLE IV
SUMMARY OF NPCR AND UACI OF DIFFERENT IMAGE WITH 256×256 IMAGE SIZE.
Images NPCRR NPCRG NPCRB UACIR UACIG UACIB
Lena 99.2020 98.4085 99.2020 33.4107 33.4309 33.5449
Brain 99.2048 98.4956 99.3125 33.4488 33.3952 33.3707
Mandril 99.5102 99.0132 99.4123 33.5100 33.3507 33.4846
Peppers 99.4262 99.2144 99.2314 33.4387 33.3085 33.5637
Jet Plane 99.2436 98.9485 99.3345 33.4456 33.3845 33.4562
TABLE V
RESULTS OF INFORMATION ENTROPY OF FIVE STANDARD IMAGES
Images Entropy H(s)
Lena 7.99915
Brain 7.99924
Mandril 7.99910
Peppers 7.99896
Jet Plane 7.99923
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 424
Copyright ⓒ 2014 GiRI (Global IT Research Institute)
8. histograms, 2-dimensional power spectral density, key space
analysis, key sensitivity, vertical, horizontal, and diagonal
correlation plots. Encryption quantitative performances were
evaluated through correlation coefficients, NPCR and UACI.
Demonstrations of wrong-key decrypted image are also
included. The proposed cryptosystem offers a potential
alternative to private data protection systems.
REFERENCES
[1] M. Philip, “An Enhanced Chaotic Image Encryption” International
Journal of Computer Science, Vol. 1, No. 5, 2011.
[2] G.H. Karimian, B. Rashidi, and A.farmani, “A High Speed and Low
Power Image Encryption with 128- bit AES Algorithm”, International
Journal of Computer and Electrical Engineering, Vol. 4, No. 3, 2012.
[3] G. Chen, Y. Mao, C.K. Chui, “A symmetric image encryption scheme
based on 3D chaotic cat maps”, Chaos, Solitons and Fractals, Vol. 21, pp.
749-761, 2004.
[4] X. Tong, M. Cui, “Image encryption scheme based on 3D baker with
dynamical compound chaotic sequence cipher generator”, Signal
Processing, Vol. 89, pp. 480-491, 2009.
[5] J.W. Yoon, H. Kim,“An image encryption scheme with a pseudorandom
permutation based on chaotic maps”, Commun Nonlinear Sci Number
Simulation, Vol. 15, pp. 3998–4006, 2010.
[6] X. Ma, C. Fu, W. Lei, S. Li, “A Novel Chaos-based Image Encryption
Scheme with an Improved Permutation Process”, International Journal of
Advancements in Computing Technology, Vol. 3, No. 5, 2011.
[7] K. Wang, W. Pei, L. Zou, A. Song, Z. He, “On the security of 3D Cat map
based symmetric image encryption scheme”, Physics Letters A, Vol. 343,
pp. 432–439, 2005.
[8] K. Wong, B. Kwok, and W. Law, “A Fast Image Encryption Scheme
based on Chaotic Standard Map”, Physics Letters A, Vol. 372, pp. 2645-
2652, 2008.
[9] S. Lian, J. Sun, Z. Wang, “A block cipher based on a suitable use of the
chaotic standard map”, Chaos, Solitons and Fractals, Vol. 26, pp. 117–
129, 2005.
[10] K. Gupta, S. Silakari, “New Approach for Fast Color Image Encryption
Using Chaotic Map”, Jour. of Information Security, pp. 139-150, 2011
[11] F. Huang, Y. Feng, “Security analysis of image encryption based on
two-dimensional chaotic maps and improved algorithm”, Front. Electr.
Electron. Eng. China, Vol. 4, No. 1, pp. 5-9, 2009.
[12] G.Lee and N. H. Farhat , “Parametrically Coupled Sine Map Networks”
,Electrical Engineering Department, University of Pennsylvania,
Philadelphia, PA, USA,15 December 2000
[13] F.Sun, S. Liu , Z. Li , Z. Lu , “A novel image encryption scheme based on
spatial chaos map”,College of Control Science and Engineering,
Shandong University, Jinan , PR China , pp. 631–640 , 2008
[14] Q. Gong-bin, J. Qing-feng,Q. Shui-sheng, “A new image encryption
scheme based on DES algorithm and Chua's circuit”, Imaging Systems
and Techniques, pp. 168 – 172, 2009.
[15] Z. Peng, T.B. Kirk, “Two-dimensional fast Fourier transform and power
spectrum for wear particle analysis”, Tribology International, Vol. 30,
Issue. 8, pp. 583-590, 1997.
[16] A. Yahya and A. Abdalla, “A Shuffle Image-Encryption Algorithm”, J.
Comput. Sci,pp.999-1002
[17] Y.Wu, Joseph P. Noonan, S.Agaian, “NPCR and UACI Randomness
Tests for Image Encryption”, Department of Electrical and Computer
Engineering Tufts UniversityMedford, MA ,USA
Sarun Maksuanpan was born in Samutsakorn
Province, Thailand in 1991. He received B.Eng. in
Computer Engineering from Computer Engineering
Department, Faculty of Engineering, Thai-Nichi
Institute of Technology (TNI). Currently, he is also a
research assistant at Intelligent Electronic Research
Laboratory. His research interests include information
security systems, cryptosystems, artificial neural
networks, and digital image processing.
Tanachard Veerawadtanapong was born in Bangkok,
Thailand in 1992. He received B.Eng. in Computer
Engineering from Computer Engineering Department,
Faculty of Engineering, Thai-Nichi Institute of
Technology (TNI). Currently, he is also a research
assistant at Intelligent Electronic Research Laboratory.
His research interests include Ad Hoc mobile network,
cryptosystems, and chaos theory.
Wimol San-Um was born in Nan Province, Thailand in
1981. He received B.Eng. Degree in Electrical
Engineering and M.Sc. Degree in Telecommunications
in 2003 and 2006, respectively, from Sirindhorn
International Institute of Technology (SIIT),
Thammasat University in Thailand. In 2007, he was a
research student at University of Applied Science
Ravensburg-Weingarten in Germany. He received
Ph.D. in mixed-signal very large-scaled integrated
circuit designs in 2010 from the Department of
Electronic and Photonic System Engineering, Kochi University of Technology
(KUT) in Japan. He is currently with Computer Engineering Department,
Faculty of Engineering, Thai-Nichi Institute of Technology (TNI). He is also
the head of Intelligent Electronic Systems (IES) Research Laboratory. His areas
of research interests are chaos theory, artificial neural networks, control
automations, digital image processing, secure communications, and nonlinear
dynamics of chaotic circuits and systems.
ICACT Transactions on Advanced Communications Technology (TACT) Vol. 3, Issue 2, March 2014 425
Copyright ⓒ 2014 GiRI (Global IT Research Institute)