1. Have you ever wanted to hide something from: Your friends? Your family? The Government?

2. If the answer is yes, then you need to learn about Steganography Steganography has nothing to do with dinosaurs! Steganography is the study of hiding information

3. Thousands of years ago, the Greeks used steganography to hide information from their enemies. One hiding method was to engrave a message in a block of wood, then cover it with wax, so it looked like a blank wax tablet. When they wanted to retrieve the message, they would simply melt off the wax.

4. You can try steganography at home by writing on a piece of paper with lemon juice. If you heat the paper with a hair dryer the juice will burn and reveal the hidden message. Note for those who wish to try this at home: Paper burns too, so stop heating the paper before it catches fire!

5. We can also perform steganography using a computer. Everything in a computer is stored as 1’s and 0’s (a bit). Bits are grouped in sets of eight, one set is called a byte. 01000001 = A 01000010 = B 01000011 = C 0 0 1 Bits One byte can be used to represent each letter of the alphabet. This is what is used in text files. 10011000 11111111 Bytes 00001000

6. 11111000 11001001 00000011 Pictures are made up of lots of little dots called pixels. Each pixel is represented as 3 bytes – one for red, one for green and one for blue. Each byte is interpreted as a number, which is how much of that colour is used to make the final colour of the pixel. 248 201 3 248 + 201 + 3 = Orange Colour

7. The difference between two colours that differ by one in either one red, green or blue value is impossible to see with the human eye. 248 + 201 + 3 = Original Colour 247 + 201 + 3 = Red -1 248 + 201 + 4 = Blue +1 If we change the least significant (last) bit in a byte, we either add or subtract one from the value it represents. This means we can overwrite the last bit in a byte without affecting the colour it appears to be.

8. 11111000 11001001 00000011 We can use images to hide things if we replace the last bit of every colour’s byte with a bit from the message. 01000001 Message: A Image with 3 pixels: 11111000 11001001 00000011 11111000 11001001 00000011 11111000 11001001 00000011 Pixel 1: Pixel 2: Pixel 3: Now we hide our message in the image: 11111000 11001001 00000010 Pixel 1: Pixel 2: Pixel 3: New image: 11111000 11001000 00000010 11111000 11001001 00000011

9. Even if we do this across a big image and with a really large message, it is still hard to tell that anything is wrong. OriginalWith Hidden Message

10. 12 7 3 65 4 11109 8 16151413 12 Normally when we hide a message in an image we just start at the top left pixel and keep writing across the image until we are done. Example: This may appear to work quite well, but if we zoom right in and look at the pixels in a block of plain colour then we can see that some pixels aren’t all the same. Plain blue sky from image of the Mount Look here

11. So what we want to do is hide in the edges of a picture because then we can avoid hiding in blocks of colour. Image we want to hide a message in Where we want to hide the message If we change an edge it is harder to notice because two pixels next to each other will already have very different colours.

12. This method of hiding is called FilterFirst, because we filter the image to find the edges before we start picking the order of pixels to hide in. 12 7 3 65 411 109 8 16151413 12 Example: Imagine our example (above) has a pink square in the middle. The algorithm will write to the edges of the square before moving out and writing around the rest of the image.

13. And if you don’t believe it’s any of this, you can try it out yourself! There’s a free program you can download called “Digital Invisible Ink Toolkit”, which can hide a computer file inside a colour image. http://diit.sourceforge.net

14. Can you pick the picture with the hidden message? http://diit.sourceforge.net

15. Can you pick the picture with the hidden message? http://diit.sourceforge.net If you guessed this one, you were right.

16. A proud University of Waikato, School of Computing and Mathematical Sciences Honours Project, 2005 http://diit.sourceforge.net