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 img1. 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" = img2. Write the resulting pixel values in the format img3.


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:

  • R=(11001011)2=(203)10
  • G=(11110010)2=(242)10
  • B=(11100001)2=(225)10

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.


Your "Kra" is hex 4B 72 61

You have 24 bits of information to steg into your image.

You have 4 24-bit pixels of hex 80 80 80 to work with, or 12 color elements of hex 80.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.