Timeline for Definition of one-way functions: randomly-chosen point vs every point
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 11, 2014 at 12:40 | history | tweeted | twitter.com/#!/StackCrypto/status/465471420080738304 | ||
| Apr 22, 2014 at 9:02 | vote | accept | Dubious | ||
| Apr 22, 2014 at 9:02 | vote | accept | Dubious | ||
| Apr 22, 2014 at 9:02 | |||||
| Apr 22, 2014 at 4:12 | history | edited | Mike Edward Moras | CC BY-SA 3.0 | Fixed formatting. |
| Apr 21, 2014 at 22:23 | history | edited | Gilles 'SO- stop being evil' | CC BY-SA 3.0 | more precise title |
| Apr 21, 2014 at 20:37 | answer | added | Arno Mittelbach | timeline score: 3 | |
| Apr 21, 2014 at 20:04 | comment | added | user991 | (Furthermore, that's not the wiki definition either.) $\;$ | |
| Apr 21, 2014 at 20:03 | comment | added | user991 | One-way functions are not generally defined like that, since that definition is provably impossible to achieve. $\:$ $M$ could try guessing $k$ based on the length of its input and then search for a preimage by brute force. $\;\;\;\;$ | |
| Apr 21, 2014 at 19:33 | history | asked | Dubious | CC BY-SA 3.0 |