Timeline for Can we assume that a hash function with high collision resistance also means a highly uniform distribution?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2019 at 22:16 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Tweak wording. Fix CFR citations to more accurately represent the case.
|
| May 23, 2019 at 17:26 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Elaborate on some back story.
|
| May 22, 2019 at 19:28 | comment | added | user2552 | Indeed. The property people often want when they reach for a cryptographic hash function is indifferentiability from a random oracle, which covers a lot of bases. | |
| May 22, 2019 at 18:16 | vote | accept | Thaina | ||
| May 21, 2019 at 5:33 | history | answered | Squeamish Ossifrage | CC BY-SA 4.0 |