Timeline for How efficient are the generic attacks regarding near-collision-resistance?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 4, 2017 at 16:53 | vote | accept | SEJPM | ||
| Jan 3, 2017 at 15:46 | answer | added | user13741 | timeline score: 2 | |
| Jan 3, 2017 at 14:18 | history | edited | SEJPM | CC BY-SA 3.0 | fixed pseudo -> near |
| Jan 2, 2017 at 19:36 | history | tweeted | twitter.com/StackCrypto/status/816005152025051136 | ||
| Jan 2, 2017 at 19:25 | comment | added | Maarten Bodewes♦ | I guess you might as well ask: how much effort is needed to find two strings $r_1, r_2$ where $r_i \in \{0, 1\}^n$ such that $\Delta(r_1, r_2) \leq k$, as "a small change to a message should change the hash value so extensively that the new hash value appears uncorrelated with the old hash value" (i.e. pseudo random) is a requirement for hash functions. Problem is, I only found a partial answer here. Maybe a big $\sum$ can help though (we could ask on Math...). | |
| Jan 2, 2017 at 17:59 | history | asked | SEJPM | CC BY-SA 3.0 |