3 ms·
Unfortunately, common steganography algos used on images are easy to detect with statistical analysis.
by ozi 13y ago
Unfortunately, common steganography algos used on images are easy to detect with statistical analysis.
- akkartik 13y agoCan you elaborate?
- knowaveragejoe 13y agohttp://en.wikipedia.org/wiki/Steganalysis http://en.wikipedia.org/wiki/Steganalysis
- DanBC 13y agoPeople read a book, they see a simple description of steganography, they whip up an implementation as a proof of concept, they share that code, other people think it's secure when it's not meant to be. (http://www.ifp.illinois.edu/~ywang11/paper/CISS04_204.pdf http://www.ifp.illinois.edu/~ywang11/paper/CISS04_204.pdf) (http://eprint.iacr.org/2005/305 http://eprint.iacr.org/2005/305) (http://vision.ece.ucsb.edu/publications/sullivan_ICIP06.pdf http://vision.ece.ucsb.edu/publications/sullivan_ICIP06.pdf)
- pkinsky 13y agoDoes this include f5? https://code.google.com/p/f5-steganography/ https://code.google.com/p/f5-steganography/
- zepolud 13y agoImages are just the lowest hanging fruit and attract a lot of sloppy schemes. You can encode information in pretty much anything as long as you are free to choose the message. You could even encode info in plain text by the lengths of non-whitespace characters, modulo 2. As an example, try using the so-defined scheme on the letters count of this very sentence; they're encoding, repeatingly, S.O.S. Posts of similar length as this one are enough to send a public key using ECDH and negotiate a shared secret for use with a block or stream cypher. You could then send short messages using this shared secret inconspicuously. Shannon entropy of English is about 1.5 bits per character so you could store quite a bit if you cared to compress it well before encrypting, preferably using a shared static dictionary.