F5 A Steganographic Algorithm. Davang Patel Thomas Schulze. Agenda. Introduction Capacity vs. Security JPEG JSTEG F3 F4 F5. Message. Message. steganographical decryption algorithm. steganographical encryption algorithm. Steganogram. Message should be invisible to an aggressor
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Capacity vs. Security
CarrierWhat is Steganography?
Histogram for JPEG coefficient after quantization
After quantization, Jsteg replaces (over writes) the least significant bits (LSB) of the frequency coefficient by the secret message. The embedding mechanism skips all coefficient with the value 0 and 1.
Resistant against the visual attacks and good capacity with 12.8 % of the steganogram's size, but the secret message is easily detected by statistical attacks. (chi-square test)
Jsteg influences pairs of the coefficients frequency of occurrence !!!
Advantage: statistical attack (chi-square test) will not be successful
Disadvantage: Less capacity and surplus of even coefficients caused by shrinking.
The surplus of even coefficients can be detected by statistical means.
-4 -3 -2 -1 0 1 2 3 4
Mapping negative coefficients to the inverted steganographic value.
Even negative coefficients and odd positive coefficients represent a steganographic one.
Even positive coefficients and odd negative coefficients represent a steganographic zero.
Note: treat each pixel as if it was a JPEG coefficient.
Improves the embedding efficiency from 1.5 bit to 3.8 bit per change.
Embed 1736 bit message
How does it work?
Consider we want to embed x1 and x2 in LSB locations a1, a2, and a3.
Random Number Generator