Abstract-Steganalysis is the art of detecting the message's existence and blockading the covert communication. Various steganography techniques have been proposed in literature. The Least Significant Bit (LSB) steganography is one such technique in which least significant bit of the image is replaced with data bit. As this method is vulnerable to steganalysis so as to make it more secure we encrypt the raw data before embedding it in the image. Though the encryption process increases the time complexity, but at the same time provides higher security also. This paper uses two popular techniques Rivest, Shamir, Adleman (RSA) algorithm and Diffie Hellman algorithm to encrypt the data. The result shows that the use of encryption in Steganalysis does not affect the time complexity if Diffie Hellman algorithm is used in stead of RSA algorithm.
Shailender Gupta in REF used two crypto techniques, i.e. Rivest Shamir Adleman (RSA) algorithm and Diffie Hellman algorithm, to encrypt the data.
Information Hiding Using Least Significant Bit Steganography and Cryptography
International Journal of Modern Education and Computer Science
Computer Science