STRONG STEGANOGRAPHY
A way to make steganography useful.

To - Original text

Tm - Masking text

k - Resulting key

k = To + Tm

k + Tm = To

p = pow(Tm) (password is the proof of work for Tm)

Ke = encrypt(k, p)

In order to find p, possible texts must be pow'd. A cost is associated with
this.

Then once p is found, it must be tried with decrypt(Ke, p).

This could fail if Ke is not really the Ke, or p is not really the correct pow.

A decryptor should try each difficulty of pow. What this means is, try with
difficultly = 1 (where only the 1st nibble needs to be 0), so on and so forth.

Hide Ke in a source of noise, since most encrypted strings have high entropy.

Possible sources:

* Images
* Videos
* Audio

Anything which has input from reality since it's full of entropy.

In the event an adversary has "god sight", they will then have to do the
following:

Gather all media posted by the victim.
Gather all texts posted by the victim.
For all media
  Extract a Ke
  For each text of texts
    Try a reasonable amount of difficulty levels
      pt = pow(text)
      decrypt(Ke, pt)
      If fail, could be Ke, could be pt. Try another difficulty.
      If fail many times, go to the next text.
      If all texts fail, try another possible Ke

Because the Ke is hidden in entropic sources (via steganography), it is 
impossible to attribute it to the victim. Because there is a significant cost 
checking all possible combinations of decryption parameters, it is very costly 
to target one person, let alone a whole nation.

This scheme allows two parties to share secret messages in the open with a
reasonable amount of confidence.