Design and Implementation of an Stegnography Algorithm using Color Transformation
Sonia Sharma1, Anjali Dua2
1Assistant Professor Sonia Sharma, Department of Computer Science and Engg., JMIT Radaur, Yamunanagar (Haryana), India.
2Scholar Anjali Dua, Department of Computer Science and Engg., JMIT Radaur, Yamunanagar (Haryana), India.
Manuscript received on 18 June 2012 | Revised Manuscript received on 25 June 2012 | Manuscript published on 30 June 2012 | PP: 142-144 | Volume-1 Issue-2, June 2012 | Retrieval Number: B0213051212/2012©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In a computer, images are represented as arrays of values. These values represent the intensities of the three colors R(ed) G (reen) and B (lue), where a value for each of the three colors describes a pixel. Through varying the intensity of the RGB values, a finite set of colors spanning the full visible spectrum can be created. In an 8-bit gif image, therecan be 28 = 256 colors and in a 24-bit bitmap, there can be 224 = 16777216 colors. Large images are most desirable for steganography because they have the most space to hide data in. The best quality hidden image is normally produced using a 24-bit bitmap as a cover image. Each byte corresponding to one of the three colors and each three-byte value fully describes the color and luminance values of one pixel. The cons to large images are that they are cumbersome to both transfer and upload, while running a larger chance of drawing an “attacker’s” attention due to their uncommon size. Our main focus to introduce the steganography using color transformation.
Keywords: Steganography, Color Transformation, RGB, Data Hiding, Imperceptibility.
Scope of the Article: Data Analytics