Chaotic Maps

In this paper generation of binary sequences derived from chaotic sequences defined over Z4 is proposed.
The six chaotic map equations considered in this paper are Logistic map, Tent Map, Cubic Map, Quadratic
Map and Bernoulli Map. Using these chaotic map equations, sequences over Z4 are generated which are
converted to binary sequences using polynomial mapping. Segments of sequences of different lengths are
tested for cross correlation and linear complexity properties. It is found that some segments of different
length of these sequences have good cross correlation and linear complexity properties. The Bit Error Rate
performance in DS-CDMA communication systems using these binary sequences is found to be better than
Gold sequences and Kasami sequences.

There is a significant increase in the number of multimedia transmission over the internet is beyond our dreams. Thus, the increased risk of losing or altering the data during transit is more. Protection of this multimedia data becomes one of the key security concerns, because millions of Internet users worldwide are infringing digital rights daily, by downloading multimedia content illegally from the Internet. The image protection is very important, as the image transmission covers the highest percentage of the multimedia data. Image encryption is one of the effective ways out to achieve this. Our world, built upon the concept of progression and advancement, has entered a new scientific realm known as Chaos theory. Chaotic encryption is one of the best alternative ways to ensure security. Many image encryption schemes using chaotic maps have been proposed, because of its extreme sensitivity to initial conditions, unpredictability and random like behaviors. Each one of them has its own strength and weakness. In this paper, some existing chaos based colour image encryption algorithms are considered with respect to various parameters like implementation, key management, security analysis and channel issues to satisfy some basic cryptographic requirements for chaos based colour image encryption algorithms.

This paper presents a novel approach of building
a secure data hiding technique in digital images. The
image steganography technique takes the advantage of limited power of human visual system (HVS). It uses
image as cover media for embedding secret message. The most important requirement for a steganographic algorithm is to be imperceptible while maximizing the size of the payload. In this paper a method is proposed to encrypt the secret bits of the message based on chaos theory before embedding into the cover image. A 3-3-2 LSB insertion method has been used for image steganography. Experimental results show a substantial improvement in the Peak Signal to Noise Ratio (PSNR) and Image Fidelity (IF) value of theproposed technique over the base technique of 3-3-2LSB insertion.

As we live and revel in a digital age, the day to day transmission of multimedia data over the internet is beyond our imaginations. Consequently, the increased risk of losing or altering the data during transit is more. Protection of this multimedia data (audio/speech, image, and video) becomes one of the major security concerns, because millions of Internet users worldwide, are infringing digital rights daily, by downloading multimedia content illegally from the Internet. The image protection is very important, as the image transmission covers the highest percentage of the multimedia data. Image encryption is one of the ways out to achieve this. Our world, built upon the concept of progression and advancement, has entered a new scientific realm known as Chaos theory. Chaotic encryption is one of the best alternative ways to ensure security. Many image encryption schemes using chaotic maps have been proposed, because of its extreme sensitivity to initial conditions, unpredictability and random like behaviors. Each one of them has its own strength and weakness. In this paper, some existing chaos based colour image encryption schemes are classified and analyzed with respect to various parameters like implementation, key management, security analysis and channel issues to fulfill some basic cryptographic requirements for chaos based image encryption algorithms from the year 2010 to 2014.

This paper presents a novel approach of building a secure data hiding technique in digital images. The
image steganography technique takes the advantage of limited power of human visual system (HVS). It uses
image as cover media for embedding secret message. The most important requirement for a steganographic
algorithm is to be imperceptible while maximizing the size of the payload. In this paper a method is
proposed to encrypt the secret bits of the message based on chaos theory before embedding into the cover
image. A 3-3-2 LSB insertion method has been used for image steganography. Experimental results show a
substantial improvement in the Peak Signal to Noise Ratio (PSNR) and Image Fidelity (IF) value of the
proposed technique over the base technique of 3-3-2 LSB insertion.

The image encryption and decryption is the one of the ways to providing security to digital image. Encryption technique is a process of converting plain image into a cipher image. Decryption technique is a process of converting cipher image into a plain image. In this paper a survey of several multidimensional chaotic maps along with genetic operator were used in order to secure an image are discussed and along with the advantages and disadvantages of those maps.

Security of a watermark refers to its resistance to unauthorized detecting and decoding, while watermark robustness refers to the watermark’s resistance against common processing. Many watermarking schemes emphasize robustness more than security. However, a robust watermark is not enough to accomplish protection because the range of hostile attacks is not limited to common processing and distortions. In this paper, we give consideration to watermark security. To achieve this, we employ chaotic maps due to their extreme sensitivity to the initial values. If one fails to provide these values, the watermark will be wrongly extracted. While the chaotic maps provide perfect watermarking security, the proposed scheme is also intended to achieve robustness.

—Security of a watermark refers to its resistance to unauthorized detecting and decoding, while watermark robustness refers to the watermark's resistance against common processing. Many watermarking schemes emphasize robustness more than security. However, a robust watermark is not enough to accomplish protection because the range of hostile attacks is not limited to common processing and distortions. In this paper, we give consideration to watermark security. To achieve this, we employ chaotic maps due to their extreme sensitivity to the initial values. If one fails to provide these values, the watermark will be wrongly extracted. While the chaotic maps provide perfect watermarking security, the proposed scheme is also intended to achieve robustness.

This paper presents the new Lorenz unlike chaotic attractor which is constructed by a three non linear first order differential equations. These equations are arranged in a three dimensional autonomous systems. The dynamic behavior of the new chaotic system is shown such as time series, strange attractors, and bifurcations. Numerical experience also shows that when the parameter 'd' is varied, the global non linear amplitude is also varying. The paper ends with some possible research and development recommendations.

　　　　These paper presents the novel idea about the various image ecryption processes available specifically the encryption of the image by using chaos theory .In the recent age of communication allows us to transfer any of the information over the longer distance.but it also involves the factors of security. This paper is the overview of the chaos theories and the encryption processes available for the transmission of image over a secured media.

Keywords: Chaotic maps, Image Encryption, Pixel Shuffling, Chaotic theory

A novel and robust chaos-based digital image encryption is proposed. The present paper presents a cipher block image encryption using multiple chaotic maps to lead increased security. An image block is encrypted by the block-based permutation process and cipher block encryption process. In the proposed scheme, secret key includes nineteen control and initial conditions parameter of the four chaotic maps and the calculated key space is 2 883. The effectiveness and security of the proposed encryption scheme has been performed using the histograms, correlation coefficients, information entropy, differential analysis, key space analysis, etc. It can be concluded that the proposed image encryption technique is a suitable choice for practical applications.

Public key cryptography has received great attention in the field of information exchange through insecure channels. In this paper, we combine the Dependent-RSA (DRSA) and chaotic maps (CM) to get a new secure cryptosystem, which depends on both integer factorization and chaotic maps discrete logarithm (CMDL). Using this new system, the scammer has to go through two levels of reverse engineering, concurrently, so as to perform the recovery of original text from the cipher-text has been received. Thus, this new system is supposed to be more sophisticated and more secure than other systems. We prove that our new cryptosystem does not increase the overhead in performing the encryption process or the decryption process considering that it requires minimum operations in both. We show that this new cryptosystem is more efficient in terms of performance compared with other encryption systems, which makes it more suitable for nodes with limited computational ability.

The art of information hiding has been around nearly as long as the need for covert communication. Steganography, the concealing of information, arose early on as an extremely useful method for covert information transmission. Steganography is the art of hiding secret message within a larger image or message such that the hidden message or an image is undetectable; this is in contrast to cryptography, where the existence of the message itself is not disguised, but the content is obscure. The goal of a steganographic method is to minimize the visually apparent and statistical differences between the cover data and a steganogram while maximizing the size of the payload. Current digital image steganography presents the challenge of hiding message in a digital image in a way that is robust to image manipulation and attack. This paper explains about how a secret message can be hidden into an image using least significant bit insertion method along with chaos.

Security of a watermark refers to its resistance to
unauthorized detecting and decoding, while watermark
robustness refers to the watermark’s resistance against common
processing. Many watermarking schemes emphasize robustness
more than security. However, a robust watermark is not enough
to accomplish protection because the range of hostile attacks is
not limited to common processing and distortions. In this paper,
we give consideration to watermark security. To achieve this, we
employ chaotic maps due to their extreme sensitivity to the initial
values. If one fails to provide these values, the watermark will be
wrongly extracted. While the chaotic maps provide perfect
watermarking security, the proposed scheme is also intended to
achieve robustness.