Talk:One-time pad: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Aleksander Stos
No edit summary
imported>Howard C. Berkowitz
Line 2: Line 2:


This is an external article. See [[Talk:One-time pad/Permission]].
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. [[User:Howard C. Berkowitz|Howard C. Berkowitz]] 21:00, 2 August 2008 (CDT)

Revision as of 20:00, 2 August 2008

This article is developed but not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  A cipher system in which the cryptographic key, i.e. the secret used to encrypt and decrypt messages, is a sequence of random values, each one of which is only ever used once, and only to encrypt one particular letter or word. [d] [e]
Checklist and Archives
 Workgroup categories:  Computers, Military and Mathematics [Editors asked to check categories]
 Subgroup category:  Security
 Talk Archive:  none  English language variant:  American English

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)

Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:One-time_pad&oldid=378847"