Application of chaos theory in data security-a survey
S. Sheela, S. V. Sathyanarayana · ACCENTS Transactions on Information Security · 2016
The fascinating developments in digital image processing and network communications during the past decade have created a great demand for real-time secure image transmission over the Internet and through wireless networks.To meet this challenge, a variety of encryption schemes have been proposed.Among them, Chaos based algorithms have shown some exceptionally good properties in many concerned aspects regarding security, complexity, speed, computing power and computational overhead, etc. Due to some intrinsic features of images, such as bulk data capacity and high correlation among pixels, traditional encryption algorithms are not suitable for practical image encryption especially under the scenario of on-line communications [1].In this direction, chaos based Stream Cipher Systems (SCS) are generally used as an alternative technique for image encryption.As we know that the random numbers are widely used in applications like cryptosystem to generate key sequences to be used in a Stream Cipher Systems (SCS).In terms of algorithmic complexity, a sequence is said to be random if the smallest program needed to produce random sequence is approximately equal to the size of the sequence itself.Such a sequence is called "maximally complex".But, no finite algorithm can produce a maximally complex sequence of infinite length.