I'd like to ask for small hint with following problem:
Using the steganographic method of the least significant bits, hide the text string "Kra" in four pixels of color with RGB code . Hide the text in the sequence of bits of the image one character at a time, ie first hide the character "K", then the character "r" and at the end of the sequence of image bits "a" will be hidden. The text is encoded according to the Latin-2 character set, so "Kra" = . Write the resulting pixel values in the format .
I assume that (128)10=(10000000)2, individual characters converted from decimal to binary system as following:
- (4B)16 = (01001011)2
- (72)16 = (01110010)2
- (61)16 = (01100001)2
At this point, I can start substituting bits in (128)10 values of R, G and B, starting at the least significant bits. However, I will get something like this:
and this is quite far from the original (128)10 values and it does not even meet the condition of unrecognizable color difference by the human eye. In addition, the last 4th pixel remains unused.
What's wrong with that method? Thank you for your explaination.