Timeline for Cryptography Pseudo Random Generator example question - proof
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2018 at 6:43 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Polish |
| Dec 3, 2018 at 6:41 | comment | added | fgrieu♦ | @nachofest: I have polished the answer to explain that. I now also use $D$ for the distinguisher, which seems more common and avoids confusion between the distinguisher and its advantage. | |
| Dec 3, 2018 at 6:35 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Polish |
| Dec 2, 2018 at 21:30 | comment | added | nachofest | perfect! Only one doubt about it, why is $Pr[A(r)=1]=2^{−(n−1)} $ ? | |
| Dec 2, 2018 at 19:43 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Oups |
| Dec 2, 2018 at 12:38 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Polish |
| Dec 2, 2018 at 12:24 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Polish |
| Dec 2, 2018 at 12:18 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Fix |
| Dec 2, 2018 at 12:13 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Fix |
| Dec 2, 2018 at 12:07 | history | edited | fgrieu♦ | CC BY-SA 4.0 | Finish |
| Dec 2, 2018 at 11:38 | vote | accept | nachofest | ||
| Dec 1, 2018 at 17:26 | history | answered | fgrieu♦ | CC BY-SA 4.0 |