Bit-O-Steg
Previous Work and Background
In our research we found a steganographic method known as JSteg, created by Derek Upsham. The basic premise behind JSteg is that its algorithm hides the data sequentially within the least significant bits of the DCT coefficients (Niels and Honeyman). The problem with JSteg is that it is not very secure; there is no secret key with which it is encrypted. Therefore, anybody that knows an image contains data with JSteg hiding can easily retrieve the hidden message. Our second hiding method, which we have called bit-o-steg, improves upon the JSteg algorithm since we employ the use of a key when hiding the data.





More Information and Analysis of JSteg
