Timeline for Are one-time pads crackable in theory?
Current License: CC BY-SA 4.0
30 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S May 23, 2020 at 14:33 | history | edited | kelalaka | CC BY-SA 4.0 |
Suggestion for post correction.
|
| S May 23, 2020 at 14:33 | history | suggested | R1w | CC BY-SA 4.0 |
Suggestion for post correction.
|
| May 23, 2020 at 13:58 | review | Suggested edits | |||
| S May 23, 2020 at 14:33 | |||||
| Jun 15, 2017 at 6:53 | comment | added | user48899 | It would probably be a good idea to read about unicity distance. "For a one time pad of unlimited size, given the unbounded entropy of the key space, we have U=infinity, which is consistent with the one-time pad being unbreakable." en.wikipedia.org/wiki/Unicity_distance | |
| S Jun 14, 2017 at 19:35 | history | mod moved comments to chat | |||
| S Jun 14, 2017 at 19:35 | comment | added | e-sushi | Comments are not for extended discussion; this conversation has been moved to chat. | |
| Jun 14, 2017 at 19:34 | history | protected | e-sushi | ||
| Jun 14, 2017 at 2:23 | vote | accept | yters | ||
| Jun 14, 2017 at 1:11 | answer | added | Luis Casillas | timeline score: 8 | |
| Jun 13, 2017 at 22:07 | answer | added | AnoE | timeline score: 0 | |
| Jun 13, 2017 at 22:03 | answer | added | v6ak | timeline score: 3 | |
| Jun 13, 2017 at 9:14 | answer | added | Rahere | timeline score: -3 | |
| Jun 13, 2017 at 3:04 | answer | added | hobbs | timeline score: 3 | |
| Jun 13, 2017 at 0:08 | answer | added | leftaroundabout | timeline score: 3 | |
| Jun 12, 2017 at 20:13 | answer | added | industry7 | timeline score: 7 | |
| Jun 12, 2017 at 18:44 | vote | accept | yters | ||
| Jun 13, 2017 at 0:20 | |||||
| Jun 12, 2017 at 18:24 | history | edited | yters |
Corrected tag.
|
|
| Jun 12, 2017 at 16:52 | history | edited | yters | CC BY-SA 3.0 |
Made both bitstrings same length to avoid confusion.
|
| S Jun 12, 2017 at 16:29 | history | suggested | Søren D. Ptæus | CC BY-SA 3.0 |
corrected grammar; changed syntax to increase readability, i.e. reflect BS1 is a random bitstring
|
| Jun 12, 2017 at 16:23 | answer | added | Andrew Jay | timeline score: 5 | |
| Jun 12, 2017 at 11:10 | review | Suggested edits | |||
| S Jun 12, 2017 at 16:29 | |||||
| Jun 12, 2017 at 7:45 | answer | added | David Schwartz | timeline score: 3 | |
| Jun 12, 2017 at 4:59 | answer | added | Alan Campbell | timeline score: 14 | |
| Jun 12, 2017 at 1:49 | history | tweeted | twitter.com/StackCrypto/status/874081106471026694 | ||
| Jun 12, 2017 at 1:05 | answer | added | kodlu | timeline score: 25 | |
| Jun 12, 2017 at 1:05 | answer | added | Maarten Bodewes♦ | timeline score: 67 | |
| Jun 12, 2017 at 0:18 | history | edited | yters | CC BY-SA 3.0 |
Clarified wording.
|
| Jun 12, 2017 at 0:12 | history | edited | yters | CC BY-SA 3.0 |
Clarified wording.
|
| Jun 11, 2017 at 23:47 | review | First posts | |||
| Jun 12, 2017 at 11:38 | |||||
| Jun 11, 2017 at 23:45 | history | asked | yters | CC BY-SA 3.0 |