Standard deviation converges for random image steganography

Abstract

The advent of the internet age has led to the increase of prominent network security issues. Information encryption has long been a method used for information security. With the rapid development of parallel computing capacities of computer hardware, this method alone could not be trusted to ensure security by increasing the key sizes, thus bringing in the information hiding techniques into the scenario. Cryptography scrambles the data to be secured while information hiding embeds the information into files which do not reveal the presence of information. Steganography and water marking are two information hiding techniques. While steganography is used for secretly embedding the sensitive information in files, watermarking is used to implement copyright protection. Steganographic techniques are being widely used these days to increase the security of information. A combination of cryptography and steganography results in very strong cryptosystems. This is a paper of unexampled prosperity, which elicits easy-to-implement, difficult-to-sense proficiency for image steganography enforcing the statistical distribution's profound laws. Bit length for embedding is adjudicated via some delineated conditions and is done so by making use of Least Significant Bit . These conditions are the index for increasing complexity as well as security. Experimental ensues in terms of BPP, embedding capacity, and stego outputs also vindicate this paper. This paper prognosticates the crucial imputes of steganography.