Timeline for Pseudorandom Generator Behavior
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2017 at 17:27 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
added 9 characters in body
|
| Dec 14, 2017 at 17:24 | comment | added | Maarten Bodewes♦ | Well, again, consider a "stream" of a single bit. There is still a 50% chance that two entirely different values of $r$ will generate the same key stream. Random doesn't mean different. It is perfectly possible to toss two sixes in a row with a perfectly balanced dice. But I shall amend my answer for an n-bit sized $r$, because I skipped that. | |
| Dec 14, 2017 at 17:18 | comment | added | ThomasWest | Oh, sorry I didn't read it properly. I think for simplicity's sake $r$ random n-bit nonce is a large-enough seed that will not cause the stream cipher to generate the same key stream. Correct? | |
| Dec 14, 2017 at 17:15 | comment | added | Maarten Bodewes♦ | Huh? No I just explained why not. If the stream cipher generated by $G(r)$ creates the same key stream then the ciphertexts will be identical. However, the larger the stream the less likely this becomes. I'm not sure what you mean with "very high-level view". | |
| Dec 14, 2017 at 17:11 | comment | added | ThomasWest | So, at a very high-level view, G(r) ⊕ m will always produce different cipher with the same m, right? | |
| Dec 14, 2017 at 16:58 | vote | accept | ThomasWest | ||
| Dec 14, 2017 at 15:56 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
added 259 characters in body
|
| Dec 14, 2017 at 15:22 | history | answered | Maarten Bodewes♦ | CC BY-SA 3.0 |