I have a photo with a resolution of $1024 \times 768$ which means $786432$ pixels in total. Let's suppose it's a 24-bit color RGB image (so 1 pixel = 3 bytes = 24 bits) and I want to hide information by only modifying the last bit of a color value. What is the maximum number of bytes that I can hide in this photo?
-
2$\begingroup$ Uhm, maybe $1024\cdot 768\cdot 3\cdot 1=2359296$ bit? $\endgroup$– SEJPMCommented Jun 3, 2017 at 18:18
-
$\begingroup$ @SEJPM Well, actually a lot more if the data is compressed. You'd probably get ~5Mbits if it's text like love letters etc. $\endgroup$– Paul UszakCommented Jun 3, 2017 at 20:47
-
$\begingroup$ @SEJPM sorry mate, it was a mistake on the lectures and I thought this was more complicated thats why I posted the question here. Yes, you're correct! $\endgroup$– bashbinCommented Jun 4, 2017 at 21:18
-
$\begingroup$ @PaulUszak Hmm let's say bmp. What will happen to the compressed data if I post the photo on social media? That will get even more compression and the loss of pixels will mean the loss of information, right? $\endgroup$– bashbinCommented Jun 4, 2017 at 21:21
-
1$\begingroup$ Worse. Chances are the image will be converted to lossy JPEG. Even if the image pixel size remain unchanged, JPEG compression throws away high frequency components (that's the lossy bit). Your compression format will be totally destroyed and the data will be irretrievable :-( You will of course be able to 100% credibly deny there's a hidden message though :-) $\endgroup$– Paul UszakCommented Jun 4, 2017 at 21:33
3 Answers
This is one of those answers that - depends.
The amount of data that can be hidden inside an image depends on the image. This is one of the concepts that most steganographers miss. We have to go to the definition of steganography. Hiding a secret message with emphasis on the hiding part. That means that a message may or may not be contained within the pixels of an image, creating plausible deniability. If you overtly don't bother to hide it, you might as well traditionally encrypt the message with AES, append it to an email and add "Secret message attached" to the subject heading.
It is also a requirement that the message is compressed /encrypted or generally whitened. Whist encryption is not absolutely necessary for steganography to be successful, the message has to be converted to almost randomly distributed bits. Any uncompressed /unencypted pattern can be easily discovered via heuristic or frequency analysis of the image. After all, image noise is almost uniformly random. If compression is used, the amount of data is becomes contingent on it's type and therefore it depends.
From a capacity and mathematical deniability perspective, the following type of image is optimum:-
It's just random noise in all three colour channels. If the least significant bit contained the compressed message, and the message was textual, you might expect 9 Mbits of capacity£. You may have issues of plausible deniability though if you're sending many of these images without a really good excuse. And they'd have to be in the form of a lossless format, which again is uncommon. Tools like OpenPuff can use lossy formats but that then reduces the message capacity.
This is also a problem image:-
Here the whole mountain side is blown out. Image analysis would easily identify manipulation of the least significant bits of the mountainside as they're all meant to be exactly 255,255,255. Almost half of the image can't be used. The steganographic tool would have to determine this. An image with deep shade presents the same problem featuring an expected RGB of 0,0,0 for that part of the image. So again the message size depends.
So you're left with using images like:-
In this instance you might get 9-18 Mbits of text$, but you're reduced to sending grainy images all the time for this message capacity. The sensor noise will mask the whitened message, especially if you use less than 1 bit per channel per pixel. And they have to be lossless formats like BMP /JPEG2000 /TIFF or PNG. None of these are particularly common in the social Facebook world, compromising the plausible deniability argument. A lossy format will reduce the message size again.
Algebraically, you can form an equation like:-
capacity = (usable %age) X (encoded bits) x (no.pixels)
which represents the difficult relationship of:-
capacity = F(artistic composition, SNR, image size)
In summary, the message size is very difficult to quantify without a detailed analysis of your photo. Why don't you post it? The most important take away here is that the issue with steganography is not encrypting a message in an image, but being able to deny that there is one in the first place. This is similar to the deniability issues with disc encryption software like TrueCrypt.
£ I'm assuming that a large sample of English prose can be compressed to 2 bits /byte. Capacity = 1024*768*3*4 =~ 9e6 bits where 4 is the compression ratio.
$ In an image this noisy (low SNR), it might be possible to utilise 2 bits per image byte for the message. Or even more?
-
$\begingroup$ Nice answer but " 5 Mbits of capacity" is that out of a 5 Mbit image? Plus the picture that helped me see that the LSB usually looks random is this one: intechopen.com/source/html/49098/media/fig3.png $\endgroup$– danielCommented Jun 4, 2017 at 9:00
-
$\begingroup$ @daniel 1024*768*3*2 =~ 5 Mbits with 2 being an approximate compression ratio for English prose. $\endgroup$ Commented Jun 4, 2017 at 11:48
-
$\begingroup$ I'm upping the feasible compression ratio for English to 4. $\endgroup$ Commented Jun 4, 2017 at 16:50
-
$\begingroup$ Thank you for all these tips! I read quite a lot of steganography materials and didn't see these included (compression, the photo examples). Cheers! $\endgroup$– bashbinCommented Jun 4, 2017 at 21:19
-
2$\begingroup$ This is not really accurate. Undetectability is not so much on the amount of data you add, and since OP specified last bit of each color, this does not really answer the question. If using lsb, undetectability is entirely on whether the data gets randomized (encrypted with a good enough encryption algorithm) before injecting it into the image. Without the original image to compare, random noise is meaningless. Capacity and mathematical deniability makes the all-noise image you have here to be no better than any other image. That image is only more likely to raise suspicions than the rest. $\endgroup$ Commented Apr 30, 2019 at 19:18
If you are using an uncompressed format. And using all the lsbs in all color channels. You get 3 bits per pixel. So786432*3/8 bytes for the entire photo.
-
$\begingroup$ But a pixel is 3 bytes, so it's 3/24, not 3/8. Really it is 1/8 (same thing as 3/24) as it is one bit per byte (least significant bit of each color). So 1/8th of 786k = 98k. $\endgroup$ Commented Apr 30, 2019 at 20:18
-
$\begingroup$ lowest bit per color channel per pixel means 3 bits per pixel. The picture had 786k pixels not bytes. If you want to say itma 1/8 th of the bytes you must start with 768*1024*3 bytes of the original then devide by 8 and end up with the same result. $\endgroup$ Commented May 1, 2019 at 4:22
-
With any image, how much change in a pixel can happen, before you notice a change? For a computer, even if only one bit in a thousand changes, it can notice... as long as it has the original image to compare against. But for stenography, you could use a picture you just took and destroy the original as soon as you used it to hide the data.
For a human... a 24 bit image has a possible about 16M colors. The human eye is said to be able to distinguish 10M colors. If you take a bit out of every byte, at the least significant bit position, or 3 bits out of every 24 bit pixel, you reduce the color availability, down to just north of 2M colors (2^21). You can see that in the image below. It shows a background with rectangles where I have modified 1, 2, 3, 4, and 5 bits. Anything more than 1 or 2 bits and it gets noticeable. Take into account that this is larger swatches, noticing discrepancies at the pixel level would be harder for the human eye. And also take into account that here you have a base comparison, the background. In a pixel by pixel change, and without the original image, there would not be that clear baseline for the eye to catch on. A change of 1 or 2 bits, in the least significant bits, would be hard to detect.
But let's play it safe and only take one out of every 8 bits, and being smart, we take the least significant bit out of every color in every pixel. That means we have one eight of the original 786432(pixels) * 3 bytes (24 bit per pixel) available to us = 294k. Compress the message you want to hide in the picture, then encrypt it (compress first!). Stick it in that 294k. You are golden.
Short answer... 294k compressed, easy, and forget detection... compression alone randomizes the data you are sending; encryption further randomizes your compressed data. Random bits in the least significant color bits of each pixel... how can you tell from noise?