Communication is one of the vast and rapidly growing fields of engineering, where
increasing the efficiency of communication by overcoming the external
electromagnetic sources and noise is considered a challenging task. To achieve
confidentiality for color image transmission over the noisy communication channels
a proposed algorithm is presented for image encryption using AES algorithm. This
algorithm combined with error detections using Cyclic Redundancy Check (CRC) to
preserve the integrity of the encrypted data. This paper presents an error detection
method uses Cyclic Redundancy Check (CRC), the CRC value can be generated by
two methods: Serial and Parallel CRC Implementation. The proposed algorithm for
the

Information security in data storage and transmission is increasingly important. On the other hand, images are used in many procedures. Therefore, preventing unauthorized access to image data is crucial by encrypting images to protect sensitive data or privacy. The methods and algorithms for masking or encoding images vary from simple spatial-domain methods to frequency-domain methods, which are the most complex and reliable. In this paper, a new cryptographic system based on the random key generator hybridization methodology by taking advantage of the properties of Discrete Cosine Transform (DCT) to generate an indefinite set of random keys and taking advantage of the low-frequency region coefficients after the DCT stage to pass them to

Images hold important information, especially in military and commercial surveillance as well as in industrial inspection and communication. Therefore, the protection of the image from abuse, unauthorized access, and damage became a significant demand. This paper introduces a new Beta chaotic map for encrypting and confusing the color image with Deoxyribonucleic Acid (DNA) sequence. First, the DNA addition operation is used for diffusing each component of the plain image. Then, a new Beta chaotic map is used for shuffling the DNA color image. In addition, two chaotic maps, namely the proposed new Beta and Sine chaotic maps, are used for key generation. Finally, the DNA XOR operation is applied between the generated key and shuffled DNA i

In present work the effort has been put in finding the most suitable color model for the application of information hiding in color images. We test the most commonly used color models; RGB, YIQ, YUV, YCbCr1 and YCbCr2. The same procedures of embedding, detection and evaluation were applied to find which color model is most appropriate for information hiding. The new in this work, we take into consideration the value of errors that generated during transformations among color models. The results show YUV and YIQ color models are the best for information hiding in color images.

     This paper presents a new RGB image encryption scheme using multi chaotic maps. Encrypting an image is performed via chaotic maps to confirm the properties of secure cipher namely confusion and diffusion are satisfied. Also, the key sequence for encrypting an image is generated using a combination of   1D logistic and Sine chaotic maps. Experimental results and the compassion results indicate that the suggested scheme provides high security against several types of attack, large secret keyspace and highly sensitive.   

As a result of the significance of image compression in reducing the volume of data, the requirement for this compression permanently necessary; therefore, will be transferred more quickly using the communication channels and kept in less space in memory. In this study, an efficient compression system is suggested; it depends on using transform coding (Discrete Cosine Transform or bi-orthogonal (tap-9/7) wavelet transform) and LZW compression technique. The suggested scheme was applied to color and gray models then the transform coding is applied to decompose each color and gray sub-band individually. The quantization process is performed followed by LZW coding to compress the images. The suggested system was applied on a set of seven stand

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene

The need for image compression is always renewed because of its importance in reducing the volume of data; which in turn will be stored in less space and transferred more quickly though the communication channels.
In this paper a low cost color image lossy color image compression is introduced. The RGB image data is transformed to YUV color space, then the chromatic bands U & V are down-sampled using dissemination step. The bi-orthogonal wavelet transform is used to decompose each color sub band, separately. Then, the Discrete Cosine Transform (DCT) is used to encode the Low-Low (LL) sub band. The other wavelet sub bands are coded using scalar Quantization. Also, the quad tree coding process was applied on the outcomes of DCT and

It is known that images differ from texts in many aspects, such as high repetition and correlation, local structure, capacitance characteristics and frequency. As a result, traditional encryption methods can not be applied to images. In this paper we present a method for designing a simple and efficient messy system using a difference in the output sequence. To meet the requirements of image encryption, we create a new coding system for linear and nonlinear structures based on the generation of a new key based on chaotic maps.

The design uses a kind of chaotic maps including the Chebyshev 1D map, depending on the parameters, for a good random appearance. The output is a test in several measurements, including the complexity of th