An efficient bit plane X-OR algorithm for irreversible image steganography
by Soumendu Chakraborty; Anand Singh Jalal; Charul Bhatnagar
International Journal of Trust Management in Computing and Communications (IJTMCC), Vol. 1, No. 2, 2013

Abstract: The science of hiding secret information in a message is known as steganography; hence, the presence of secret information is concealed. It is the method of hiding cognitive content in same or another media to avoid detection by intruders. This paper introduces a new method wherein irreversible steganography is used to hide an image in the same medium so that the secret data is masked. The secret image is known as a payload and the carrier is known as a cover image. X-OR operation is used amongst mid level bit planes of carrier image and high level bit planes of secret image to generate new low level bit planes of the stego image. Recovery process includes the X-ORing of low level bit planes and mid level bit planes of the stego image. Based on the result of the recovery, subsequent secret image is generated. An RGB colour image is used as carrier and the secret image is a grayscale image of dimensions less than or equal to the dimensions of the carrier image. The proposed method greatly increases the embedding capacity without significantly decreasing the PSNR value.

Online publication date: Sat, 12-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Trust Management in Computing and Communications (IJTMCC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email