Timeline for Definition of a distinguisher
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 6, 2021 at 18:50 | history | edited | Patriot |
added two tags
|
|
| Sep 28, 2017 at 22:29 | answer | added | Luis Casillas | timeline score: 6 | |
| Sep 28, 2017 at 17:10 | comment | added | Luis Casillas | Note it's not "any polynomial-time algorithm" as you paraphrase it, it's the larger set of probabilistic polynomial-time algorithms—programs that run on a machine that, in addition to the usual Turing-complete machinery, also has an operation to generate random bits (the "random coins" of the definition) and read them into program memory so they can influence the execution and result of the programs. | |
| Sep 28, 2017 at 16:27 | comment | added | poncho | Actually, if you look at the above definition, it doesn't matter if $D$ is more likely to produce a 1 if given a random function, or if it tends to produce a 0; the important thing is that it acts differently between the two cases... | |
| Sep 28, 2017 at 16:18 | review | First posts | |||
| Sep 29, 2017 at 4:53 | |||||
| Sep 28, 2017 at 16:13 | history | asked | theQman | CC BY-SA 3.0 |