>a solution that problem could be a cipher where a key (K1) decrypts the
>ciphertext to the real text and a key (K2) decrypts the ciphertext to a
>meaningful text, but not the real one. In that way if the police requires
>the key you can provide K2 and nothing is lost.
Excellent idea! Actually, K2 doesn't need to be a key at all. You could have
a simple test such as:
if Key=K2
then println("mary had a little lamb");
else decrypt(msg,Key);
Whether K2 is a real key or not, you would need to have a different "cover"
text for each encrypted message, it would seem. I think your believability
goes down when every message decrypts to the same nursery rhyme. ;)
--PH
____________________________________________________________________
Get free email and a permanent address at http://www.netaddress.com/?N=1
