Timeline for Why this brute force attack doesn't reduce all cryptographic hash functions' security bits against collision attacks to N/3?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2019 at 14:44 | comment | added | Yakk - Adam Nevraumont | Is the expected before repeat related to the birthday paradox by any chance? | |
| Aug 28, 2019 at 14:03 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Correct minor errors: the relevant quantity is the number of points before a repeat, not the length of the cycle itself, and is off by one from what I wrote; the expected cycle length is different by a factor of two.
|
| Aug 28, 2019 at 8:13 | comment | added | Yanai Eliyahu | I have chosen this answer because of the expected cycle length, this explains directly why it doesn't work. | |
| Aug 28, 2019 at 8:12 | vote | accept | Yanai Eliyahu | ||
| Aug 28, 2019 at 1:51 | comment | added | Squeamish Ossifrage | I feel like Harris's paper answers about a quarter of all the questions on this site! | |
| Aug 28, 2019 at 1:44 | comment | added | kodlu | +1 for the classical reference to Harris, and a softcopy, which already has most of the results in later papers by crypto experts... | |
| Aug 27, 2019 at 22:47 | history | answered | Squeamish Ossifrage | CC BY-SA 4.0 |