Hyper Chaotic Systems

being attacked, encrypt it with a secret key to obtain an encrypted bit stream . For that AES encryption is used. After AES encryption, will embed at the fourth bit position of . Some related information about the mosaic image generation process into the mosaic image for use in the secret image recovery process are also embed at the last fourth bit position of . Such information, described as a bit stream I like M, includes the following data items: 1) encryption key; and 2) total length of before encryption. After all this process Target image with mosaic image, residual value and all information that required to recover original image are transmitted to receiver

In this paper, we propose a secure way of data sharing scheme, which gives secure key distribution and data sharing for dynamic group. The main contributions of our scheme

Yong Feng et al, in 2009,the author proposed a new invertible two-dimensional chart, shouted Line chart, for picture encryption and decryption. It charts a picture to an array of pixels and next, charts it back from the array to alike sized image. A Line chart consists of two submaps: the left Line chart and the right Line chart that are utilized for picture encryption and decryption. In order to vanquish the shortcoming of standard picture encryption ways established on two-dimensional (2-D) charts that can be utilized merely for permutation, this paper presents a novel picture encryption way established on the Line charts, that can present two procedures of picture encryption simultaneously, permutation and substitution, employing the alike maps. The counseled picture encryption does not have data loss. Supplementary gains contain that it is fast and there is no check on the length of protection key that is desirable for disparate protection requirements. Simulation aftermath display the effectiveness of the new picture encryption scheme. [20]

Voice encryption system in wireless communication became very important. The advancement of modern wireless telecommunication and multimedia technologies makes a huge amount of sensitivity voice information travel over the open and shared networks. Voice based communication becomes prominent in the application areas of military, voice over IP, e learning, voice-conferencing, telephone banking, telephone services of market securities, etc. These applications are critical broadcast regarding the protection of data integrity and authorized user privacy.

Today web is going towards the multimedia data in which image covers the highest percentage of it. But with the ever-increasing growth of multimedia applications, security is an important aspect in communication and storage of images, and encryption is the way to ensure security [1]-[2]. Image encryption techniques try to convert original image to another image that is hard to understand and to keep the image confidential between users, in other word, it’s important that without decryption key no one can access the content. Image encryption has applications in internet communication,

incorporates three cases, specifically: added substance homomorphism; include homomorphism, question picture highlight is not encoded; full homomorphism encryption strategy. In [15], Bellafqira et al. proposed a protected usage of a substance based picture recovery (CBIR) technique that works with homomorphic scrambled pictures from which it separates wavelet based picture includes next utilized for ensuing picture examination. Test comes about show it accomplishes recovery execution on a par with if pictures were prepared nonencrypted.

There has been a need for a non-breakable encryption algorithm desired after since the establishment of Cryptography was first matured. However, an algorithm is advised to be immune as long as there has not been found susceptibility through cryptanalysis. Symmetric-key block ciphers abide as the largest and critical aspect in many cryptographic systems. Independently, they add confidentiality. As a central construction block, their adaptability grants the manufacturing of pseudorandom stream ciphers, number generators, hash functions, and MAC’s. Moreover they serve as an essential component in message verification methods, symmetric-key signature schemes, entity confirmation protocols, and data purity. Although Block ciphers are very powerful objects their design flaws and complex interface opens the door for wider attacks.

We have also analyzed that without making motion vectors encryption, we can’t get temporal redundancy. Motion vector encryptions are proposed by many authors [4-9]. However, analysis shown in this paper said that 45-50% of motion vectors for each frame are not encrypted. Thus, better encryption method is proposed at here in expense with compression bandwidth. Overall, we have to make the balance between security and increase in compression bandwidth.

We have also analyzed that without making motion vectors encryption, we can’t obtain temporal redundancy. Motion vector encryptions are proposed by several authors [4-9]. However, analysis shown in this paper said that 45-50% of motion vectors for each frame are not encrypted. Thus, a better encryption method is proposed at here in expense with compression bandwidth. Overall, we should create the balance between security and the increase in compression bandwidth.

The probabilistic model of the VC scheme was first introduced by Ito et al. [2], where the scheme is based on the basis matrices, but only one column of the matrices is chosen to encode a binary secret pixel, rather than the traditional VC scheme utilizing the whole basis matrices. The size of the generated transparencies is identical to the secret image. Yangs [31] also proposed a probabilistic model of VC scheme, and the two cases and are explicitly constructed to achieve the optimal contrast. Based on Yang [31], Cimato et al. [32] proposed a generalized VC scheme in which the pixel expansion is between the probabilistic model of VC scheme and the traditional VC scheme. Encrypting an image by random grids (RGs) was first introduced by Kafri and Keren [26] in 1987. A binary secret image is encoded into two noise-like transparencies with the same size of the original secret image, and stacking of the two transparencies reveals the content of the secret. Comparing RGs with basis matrices, one of the major advantages is that the size of generated transparencies is unexpanded. The RG scheme is similar to the probabilistic model of the VC scheme, but the RG scheme is not based on the basis matrices. The recent studies include the RG for colour image [27], and RG schemes [28], [29]. We also compare the proposed method with RG.

Abstract—Embedded systems being designed are highly reliable, respond well to the real time systems, provide flexible functionality and able to work given low power sources. These various systems currently find their applications in the areas which involve managing very extensive data including location determination, health, bank details and personal information which makes security a vital factor of the embedded system domain. In this paper, the security algorithms involving cryptography has been focused in the area of networks and basic processors. We study the two main classification of cryptographic algorithms namely symmetric-key and public-key ciphers, used to protect communication networks by utilizing the different security protocols as well as protecting data of the computer systems. Symmetric-key ciphers and public key ciphers find their applications in fields governing data encryption, authentication and digital signatures. Further becoming an essential part of the embedded systems involving programmable network devices as there is a rise in the connectivity of the networks which increases the role of cryptography algorithms from servers to sensors and smartcards. We study the implementation of encryption algorithms on System on Chip dual core ARM model. However, majority of

part uses random sequences generated from chaos system with the help of an encryption key. This key is then used to encrypt media contents with a neural network structure. However, the apparent disadvantage in this scheme is that more sub-keys need to be transmitted to the receiver. In another research [45], the authors propose an image encryption/decryption algorithm based on chaotic neural network. The employed network comprises two layers each with three layers: chaotic neuron layer (CNL) and permutation neuron layer (PNL). The approach uses a 160-bit-long authentication code to generate initial conditions and the parameters of both layers. The overall process is repeated several times to make it robust and increasingly complex. The proposed method uses two more keys where a slight mismatch in one of them fails in successfully decrypting an image. The authors in [46] propose an encryption method based on a hybrid chaos-based encryption algorithm. The algorithm employs permutation–diffusion architecture that uses chaotic control parameters for permutation. These control parameters for the permutation stage are generated by a logistic map. In the diffusion stage, another chaotic logistic map with different initial conditions and parameters is used to generate initial conditions for a hyper-chaotic Hopfield neural network to generate a key stream for image homogenization of the shuffled image. In order to provide summarized view, the authors in [47] present survey of

Mobasseri presented the method of a message either encrypted or unencrypted, can be hidden in a computer video file (containing the picture of, for instance, an innocent 2 year old baby) and transmitted over the Internet, a CD or DVD, or any other medium [5].Shiguo lian provide the main goal of steganography is to communicate securely in a completely undetectable manner and to avoid drawing suspicion to the transmission of a hidden data [4]. III. PROPOSED WORK A. Video Compression Video compression uses modern coding techniques to reduce redundancy in video data. Video compression typically operates on square-shaped groups of neighboring pixels, often called macro blocks. These pixel groups or blocks of pixels are compared from one frame to the next and the video compression code sends only the differences within those blocks.

RA codes are already applied in image data hiding. In [3], adaptive block selection results in de-synchronization and they utilized RA codes to handle erasures. Insertions and erasures can be also handled by convolutional codes as in [4]. The authors used convolutional codes at embedder. However, the burden is placed on the decoder. Multiple parallel Viterbi decoders are used to correct de-synchronization errors. However, it is observed [4] that such a scheme is successful when the number of selected host signal samples is much less than the total number of host signal samples.

Watermarking is the process of embedding new data into image, audio or video. Digital Watermarking technique is used to hide a secret or personal message to protect a products copyright or to demonstrate data integrity. To provide double protection, after the watermarking process, the watermarked image tends to go through an encryption process using CHAKRA – symmetry key encryption algorithm which encrypts the data with the concepts of Cartesian coordinate geometry and circle generation. In this paper, we perform watermarking on different types of images like BMP, JPEG etc.., and the input image is pre-processed and converted into JPEG-LS format which contains enhanced quality.