A secured Transmission of data using 3D chaotic map encryption and data hiding technique

Abstract
Transmission of important data like text, images, video, etc over the internet is increases now days hence it's necessary to use of secure methods for multimedia data. Image encryption is most secure than other multimedia components encryption because some inherent properties such as higher data capacity and high similarity between pixels. The older encryption techniques such as AES, DES, RTS are not suitable for highly secure data transmission on wireless media. Thus we combine the chaotic theory and cryptography to form an valuable technique for information security. In the first stage, a user encrypts the original input image using chaotic map theory. After that data-hider compresses the LSB bits of the encrypted image using a data-hiding key to make space for accommodate some more data. In now day's image encryption is chaos based for some unique characteristics such as correlation between neighboring pixels, sensitivity to initial conditions, non-periodicity, and control parameters. There are number of image encryption algorithms based on chaotic maps have been implemented some of them are time consuming, complex and some have very little key space. In this paper we implement three non linier differential chaos based encryption technique where for the first time 3 differential chaoses is used for position permutation and value transformation technique. In the data hiding phase, data which is in the binary forms embedded into encrypted image by using least significant bit algorithm. We tabulate correlation coefficient value both horizontal and vertical position for cipher and original image and compare performance of our Method with some existing methods. We also discuss about different types of attack, key sensitivity, and key space of our proposed approach. The given approach is very simple, fast, accurate and it have been applied together as a double algorithm in order to serve best results in highly unsecure and complex environment. Each of these algorithms are been discussed one by one below.

This publication has 13 references indexed in Scilit: