New answers tagged

0

I devised a (presumably non-conventional) scheme which re-formats an input text stream like emails a little bit such that the number of words in a line of the output file mod 2 gives the stego bit in the line. The stego bit rate is thus admittedly rather low, but it could under circumstances (e.g. when the realm of discourse is highly limited such that a few ...


2

The International Journal of Soft Computing and Engineering has published many articles on the subject. If you want to move away from simple bit-twiddling in lossless images, take a look at spread-spectrum techniques for images and audio files. There are plenty of tools available for hiding data in compressed images and audio (e.g., Steghide, JPHide and ...


5

I'll assume the question really is: when I perform low-order-bit steganography on an uncompressed image (inserting 6 bits encoding a character into the low-order bit of 6 bytes coding the R, G and B channels of 2 pixels), I find that compressing the resulting image gives a bigger file than compressing the original image for a given setting of the program ...


0

If I'm reading your question correctly, you want to hide an RSA encrypted message within a 256x256 BMP file and you're wondering how this can be done as each pixel only has a range of $[0;255]$. This is fairly easy, as your message is likely to be shorter than the $256\times256=65536$ least significant bits at your disposal. You first simply encrypt the ...


1

I think You can embedding message $A$ into message $B$ with simple $LSB$ but you will have message $B'$ and maybe unmeaning. If you want the message $B'$ will be meaning, you should design $B$.



Top 50 recent answers are included