All possible decryptions with the same length as the message are equally likely
This is one property of OTPs that I think is often overlooked for practical applications. This could be used for plausible deniability reasons. For instance, say you took the source code to a DeCSS program and a letter to your Grandma, which are both exactly the same length. You then generate a random string of characters, also of the same length. There exist two seperate OTP keys for that character stream, one of which will decrypt the stream into the DeCSS source and the other into the letter. Generating these keys is as simple as XOR'ing the stream against the document. If you get caught, you can give the authorities the key for the letter, and they thus have no evidiance. You can then walk away and give your freinds the key for the source code.
----
send money to your kernel via the boot loader.. This and more wisdom available from Markov Hardburn.
In reply to Re: Re: Re: Unbreakable crypto
by hardburn
in thread Unbreakable crypto
by thor
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |