## Comment: Re:Open source? (Score 2) 215

No. I think you've misunderstood one-time padding (or brute-forcing).

Brute forcing is when you try (almost) every possible key, which is significantly shorter than the message, to see what the message will turn out with said key hoping to find the right one. If the message turns out to make sense (contain english words or ascii alphabet for example) it is likely to be correct.

With OTP the key and the message are of equal length. Going through every key is the same as going through every possible message. So you will not only hit alphabet, but you'll get shakespeare and snowden leaks alike.

That makes all forms of bruteforcing futile. No extra codes necessary.

One bit example:

my message is M (0 or 1) and my pad is P (0 or 1).

M xor P = C cipher text, and equally C xor P is M.

Now, given C, say 1. You can trivially bruteforce it into 0 as if P had been 1 or into 1 as if P had been 0, but that solves nothing. Because both possibilites are equally likely. Repeat that on every bit and all you will ever know about the message is its length.

The length leakage is also easy to counter to some extent by appropriate amount of random padding (adding some extra gunk to the end).