Timeline for Analyzing the security of hash approaches
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 11, 2023 at 5:31 | vote | accept | vimwitch | ||
| Apr 10, 2023 at 5:22 | comment | added | Daniel S | There’s an even easier first pre-image attack. Consider the hash of $k$ copies of $x$. | |
| Apr 9, 2023 at 17:29 | comment | added | fgrieu♦ | That was not my idea about first preimage resistance for 2. Rather, it's that if $H$ has $n$ bits, there is a first preimage attack with expected cost like $2^{n/2}$ hashes somewhat like for the birthday problem. | |
| S Apr 9, 2023 at 15:15 | review | First answers | |||
| Apr 12, 2023 at 15:26 | |||||
| S Apr 9, 2023 at 15:15 | history | edited | vimwitch | CC BY-SA 4.0 |
update first preimage problem
|
| Apr 9, 2023 at 15:09 | history | edited | vimwitch | CC BY-SA 4.0 |
update first preimage problem
|
| S Apr 9, 2023 at 15:02 | review | First answers | |||
| Apr 9, 2023 at 15:14 | |||||
| S Apr 9, 2023 at 15:02 | history | answered | vimwitch | CC BY-SA 4.0 |