Note that there are some explanatory texts on larger screens.

plurals
  1. USuser1563721
    primarykey
    data
    text
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COI think that there is no way how to construct reliable steganographic algorithm where the hidden message could survive the various JPEG compression options because there will always be a relation between the algorithm and the compression method used. And when I build the compression gateway and every image that will come to me will go through it then I will destroy every hidden message in it regardless the algorithm that was used. Or do you know about some algorithm that works and could survive?
      singulars
    2. COAnother algorithm that I've tried is the one described in the following article: [http://nas.takming.edu.tw/chkao/lncs2001.pdf](http://nas.takming.edu.tw/chkao/lncs2001.pdf). But I haven't reached results as authors of that article. The results was better than using repetition code but also it can't be used as a reliable algorithm for compression gateways across internet. Everytime the image is compressed or recompressed the message would be with high probability destroyed.
      singulars
    3. COI was trying to implement a simple algorithm that would be resistant to JPEG compression. First of all I tried to modify all LSBs in image pixels to 1 and save it as JPEG. After that I tried to recover 1s with repetition code to see if this simple code added enough redundancy to image in order to get these 1s back. But it doesn't, repetition code using for this purpose is not robust and can't be used.
      singulars
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload