DOC PREVIEW
SJSU CS 265 - LSB Steganography

This preview shows page 1-2 out of 7 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 7 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 7 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 7 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

LSB Steganography:Information Within InformationIntroductionThe Basic Idea of LSB EmbeddingPicking a Good MediumThe Simple Case – 24-bit Bitmaps8-bit/Grayscale ImagesOther Variations of LSBConclusion – The Ups and Downs of LSBReferencesLSB SteganographyLSB Steganography:Information Within InformationLeo LeeComputer Science 265, Section 2Professor StampApril 5, 20040LSB SteganographyIntroductionSteganography is the science of hiding secret messages within an otherwise normal, innocent medium. Steganography has long been in use, even before the invention of the computer. For example, warring nations used invisible ink and microdots to communicate messages covertly. However, computer technology has taken steganography to the next level. Nowadays, messages are typically hidden within digital images, video and audio. This paper focuses on one particular popular technique, Least Significant Bit (LSB) Embedding, using digital images as the medium. The terminology is that a message is hidden within a cover image to produce a stego-image. First, the choice of a good cover image is discussed. Then, variations of LSB Embedding are detailed. Finally, the advantages and disadvantages of LSB Embedding are summarized.The Basic Idea of LSB EmbeddingThe concept of LSB Embedding is simple. It exploits the fact that the level of precision in many image formats is far greater than that perceivable by average human vision. Therefore, an altered image with slight variations in its colors will be indistinguishable from the original by a human being, just by looking at it. By using the least significant bits of the pixels’ color data to store the hidden message, the image itself will seem unaltered. Picking a Good MediumAs important as the steganographic technique is, equally important is the choice of the cover image. In LSB Embedding, a poor choice of cover image can lead to a stego-image that is easily differentiable from the original. Current image formats can be divided into two broad categories, lossy and lossless (Johnson & Jojodia, 1998). Lossy images are those formats, which loses some ofthe image’s data when stored. An example would be JPEG. The plus side of lossy images, in particular JPEG, is that it achieves extremely high compression, while maintaining fairly good quality. However, due to the very nature of lossy formats, it is not suitable for LSB Embedding. Since LSB Embedding spreads the hidden message throughout the image’s data, the loss of the image’s data by compression would lead to 1LSB Steganographythe lost of parts of the hidden message. On the other hand, lossless images are suitable for LSB Embedding, since the integrity of the image data is preserved. However, they donot have the high compression ratio that lossy formats do.Not all lossless images are good candidates as a cover image. 24-bit bitmaps, as well as grayscale images and other color images with small variations in its palette are good candidates as cover images. The reasons will be detailed in the respective sections below.The Simple Case – 24-bit BitmapsPerhaps the simplest implementation of LSB Embedding is that using 24-bit bitmaps. According to the Worldwide Center for the Study of Leif Computer Science Team (2001), the structure of a 24-bit bitmap is a bitmap header, followed by the pixels’ data. Each pixel is represented by three bytes, representing the red, green and blue color values for that pixel. The higher the number, the more intense that color is for that pixel. For example, if the data for a pixel pa were FF FF FF16, that pixel would contain the most of all three primary colors and thus be white. LSB uses the fact that changing the LSB of these bytes would produce only a minute, insignificant change to the color value (Johnson & Jojodia, 1998). For example, changing the color values for pa to FE FE FE16 would make the color darker by a factor of1/256. This change would be imperceptible to the human eye. The idea then is to simplyencode one bit of the hidden message in the LSB of each byte of pixel data. Thus, we canembed <number of bytes per pixel> * <number of pixels in image> bits of secret information in any particular cover image. In the implementation however, one should be aware of a particular detail. In 24-bit bitmaps, the number of bytes per row is always end-padded with zeros to be a multiple of four. Although initially one may think to use these extra bytes to store hide additional information that would be unwise. Since these bytes are supposed to contain zeros, any alteration would be easily detectable. Thus, in order for the image to remain inconspicuous, only the LSBs of the actual pixel data should be altered. Listing 1 and 2 contain an implementation of LSB Embedding using 24-bit bitmaps as described.2LSB Steganography8-bit/Grayscale ImagesFormats such as 8-bit bitmaps use a palette. Instead of storing the pixel’s color value directly, each pixel is represented by an offset into a palette. The palette itself is in the header, and contains all of the color values in that image. In an 8-bit image, there are 256 possible colors in the palette. Johnson and Jojodia (1998) note that LSB Embedding cannot usually be done directly as in the 24-bit case. This is because even a plus or minus one change to the palette offset, could change color value drastically. Neighboringcolors in the palette do not necessarily have to be similar.One way around this problem is to simple use only cover images that do contain only similar colors. In fact, many Steganographers advise the use of grayscale images, since it is difficult to discern the various shades of gray from one another. Johnson and Jojodia (1998) presents that the EzStego tool uses this approach. It assumes that the cover image has many similar colors, and tries to rearrange the colors within the palette so as to minimize the change between adjacent colors in the palette.Johnson and Jojodia (1998) present another tool, S-Tools’ approach to this problem. It solves this problem by reducing the 256 colors limitation of the 8-bit bitmap, and using the freed up bits to store the message. It tries to do this in such a way as to preserve the quality of the original cover image. However, degradation will inevitably occur. For example, it can reduce the palette to basically 128 unique colors (7-bits to represent the offset). Then, two similar colors are created for each of these


View Full Document

SJSU CS 265 - LSB Steganography

Documents in this Course
Stem

Stem

9 pages

WinZip

WinZip

6 pages

Rsync

Rsync

7 pages

Hunter

Hunter

11 pages

SSH

SSH

16 pages

RSA

RSA

7 pages

Akenti

Akenti

17 pages

Blunders

Blunders

51 pages

Captcha

Captcha

6 pages

Radius

Radius

8 pages

Firewall

Firewall

10 pages

SAP

SAP

6 pages

SECURITY

SECURITY

19 pages

Rsync

Rsync

18 pages

MDSD

MDSD

9 pages

honeypots

honeypots

15 pages

VPN

VPN

6 pages

Wang

Wang

18 pages

TKIP

TKIP

6 pages

ESP

ESP

6 pages

Dai

Dai

5 pages

Load more
Download LSB Steganography
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view LSB Steganography and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view LSB Steganography 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?