This entire article is utterly false and misconceived. It asserts that because "ONETIMEPAD" will be encrypted as "ONETIMEPAD" one time in 141167095653376, one time pads are not actually secure. The reason this is false is that just as often, "ONETIMEPAD" will be encrpted as "TWOTIMEPAD", or any other 10 letter string. Thus, the encryped string provides no information about the plain text, and so is perfectly encrypted. This article utterly wrong.
So it still fits the definition of perfect secrecy, but (with vanishingly small probability when the key is large) it's possible for a key to be chosen that is more "guessable"?<p>I don't think this is a problem. Depending on the guess for the key an attacker could get back <i>any possible message</i> as the plaintext. So there is no reason for them to believe that the message they obtain by using a simple key (e.g. AAAAAAAAAAAA as in the example) is the original plaintext?
I was skeptical at first, but it looks like TechCrunch's foray into academic publishing is finally starting to pay off. It's been amazing to follow their transition from a tech tabloid to a place you can find groundbreaking work in fields like cryptography.
This article makes me not trust Zendo.<p>If you're going to take a pop at Shannon (and all the other cryptographers who support that) you probably need to i) have a cleaer description of what you're doing and ii) do some math.
Next up: TechCrunch solves the halting problem by using<p><pre><code> while(1){
;
}
</code></pre>
and<p><pre><code> exit(1);
</code></pre>
as counterexamples.
This is a case where the article author is <i>either</i> a moron, <i>or</i> a liar.<p>Either genuinely believe that he is correct (in which case he is a moron) or he <i>doesn't</i> genuinely believe it, but is saying it for some reason (in which case he is a liar).<p>Those are the only two possibilities here, and neither is flattering.