Talk:One-time pad

This is an external article. See Talk:One-time pad/Permission.

Disagreement with external article

First, since the under the heading "bogus one time pads" was changed at CZ, the article is no longer completely external.

Second, while it is said that the invulnerability is "easily" proved, neither the proof is given here, nor is Shannon's proof cited. CZ doesn't insist that everything be sourced, but in a case like this, when sources are readily available, it seems reasonable to have it. Shannon is the original, but there are other reasonable sources.

Third, and speaking again to sourcing, give examples or citations, not just generalities about marketing and stream ciphers. In a few minutes of searching, I was able to find, admittedly with some shock that the patent was granted, "US Patent 6337910 - Method and apparatus for generating one time pads simultaneously in separate encryption/decryption systems", which is not generating one-time pads, but exchanging seeds for pseudorandom number generators. See http://www.google.com/url?sa=t&ct=res&cd=2&url=http%3A%2F%2Fwww.patentstorm.us%2Fpatents%2F6337910-description.html&ei=GwuVSNqrMYye8gTq9ZCvCg&usg=AFQjCNGvxb-Q4DbT1dwZVWc7j9eZLqMWJQ&sig2=I36umttpebshrYwg5TlFRQ

There is a quite interesting discussion in some joint lecture notes from MIT and UCSD at http://www.cs.ucsd.edu/~mihir/papers/gb.pdf, with Chapter 3 variously pointing out that some truly natural phenomena can be autocorrelating and thus weak one-time pads, and some arguments, which I want to reread in detail, about a claim that some pseudorandom number generators can be proven "that a generator that passes the next-bit test is perfect in the sense that it will pass all polynomial-time statistical tests."

I am concerned, as a Computers Workgroup Editor, that this article would not meet the CZ:About criteria for eventual approval of "authoritative, error-free, and well-written as encyclopedia articles are expected to be" The current version might develop into such, but it needs much work. Howard C. Berkowitz 21:00, 2 August 2008 (CDT)

The possibility of pseudo-random methods that are adequately random

We currently have a section with that title. It contains good material, but I do not feel it belongs in this article.

Certainly there are such techniques; any stream cipher could be described as a pseudo-random method that is adequately random. However, they are not one-time pads, so I don't think they should be discussed here. Move that text to stream cipher? Somewhere else, like random number? Sandy Harris 22:10, 4 August 2008 (CDT)