Digital Invisible Ink Toolkit
DIIT provides a simple tool that can hide a message inside a 24-bit colour image so that knowing how it was embedded, or performing statistical analysis, does not make it any easier to find the concealed information. It also provides a framework for implementing other steganography algorithms for use in the tool.
| Tags | multimedia Graphics Security Cryptography |
|---|---|
| Licenses | GPL |
| Operating Systems | OS Independent |
| Implementation | Java |
| Translations | English |
Recent releases
- 10 Sep 2007 06:50
Changes: DIRT is an implementation of Shai Avidan and Ariel Shamir's "Seam Carving for Content Aware Image Resizing" algorithms. It allows you to remove and add seams to an image, resizing it in a non-uniform manner. DIRT uses the filter algorithms from DIIT to find the seams.
- 09 Jun 2006 08:09
Changes: This release adds the ability to perform LSB matching with all hiding algorithms and fixes a few small bugs that occasionally caused the GUI to crash.
- 04 Feb 2006 23:42
Changes: This release adds a new filter for the filterable hiding algorithms, two new hiding algorithms, and a couple of major interface improvements. The interface now sports an embedding rate progress bar, so you know in advance how much of the available hiding space will be used. The interface also has a new "Explain" button which gives a small synopsis of how each algorithm works.
- 26 Oct 2005 17:28
Changes: This release tunes the hiding algorithm "BattleSteg" and fixes the interface bug which caused the algorithm options to come up incorrectly when the window was opened for the second time.
- 21 Oct 2005 02:10
Changes: Sample pairs analysis code has been implemented in DIIT. With the pre-existing RS analysis, this tool allows for accurate steganalysis of images. Traditional (black and white) laplace graph information can also now be produced by DIIT. The bugs in some benchmarking formulas have been corrected.
- All comments
Recent commentsRe: Sparse doc.
> Hi,
> it might be useful if you wrote - how
> many bytes it can code (probably
> fraction of height x width, 1/100?),
> examples of hidden information with
> different sizes etc. There is also
> certainly a way to decrypt it, which is
> not mentioned at all. Comparison with
> other similar tools would be interesting
> as well....
> jaromrax
I agree - I'm currently working on all the documentation, and will post it up to the homepage as soon as it's done. As a quick answer though:
The number of bytes it can encode is maximumsize = (imageheight * imagewidth * 3 * (endbits - startbits)) / 8
Which is the size of the image, times the number of colour values (red, green, blue) times the number of bits you define to hide it in. I think I have allowed a maximum of 7 bits to hide in. It's divided by 8 to turn bits into bytes.
The tool decrypts the hidden message too - as long as you know the algorithm it is hidden using and the password. The only other way to decrypt the hidden message is to try every combination of passwords - which takes a very long time as it's hidden randomly.
From what I've seen of other lsb steganography tools, this performs a lot better, almost halving the detection rate. As part of the final release there will be a load of benchmarking put into the interface, so you are able to see for yourself how well the different algorithms do.
I will work on the documentation but the next release is sure to be a lot better.
Thanks for the feedback :)
Kathryn
Sparse doc.
Hi,
it might be useful if you wrote - how many bytes it can code (probably fraction of height x width, 1/100?), examples of hidden information with different sizes etc. There is also certainly a way to decrypt it, which is not mentioned at all. Comparison with other similar tools would be interesting as well....
jaromrax