Text Steganography using Anagrams
by Javantea
Sept 23, 2006

A secret can be hidden in a large amount of data using random combination of 
words. The words can be decoded into the secret by knowledge of a secret 
process.

secret = s e c r e t

key    = 2 7 1 4 3 6

out[0] = rword()
out[1] = rword(c)
out[2] = rword(s)
out[3] = rword(e)
out[4] = rword(r)
out[5] = rword()
out[6] = rword(t)
out[7] = rword(e)

To decode, test which categories each word fits into. Then use the code to find 
the correct order. To make the system more secure, use a very large number of 
words and a large key.

