Timeline for Is the composition of collision resistant hash with non collision resistant hash a collision resistant hash?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2013 at 13:24 | comment | added | Cryptographeur | "Uniformly distributed" over what? $f(x)=0$ is uniformly distributed over its image of $\{0\}$. | |
| Dec 3, 2013 at 13:19 | history | edited | ax101 | CC BY-SA 3.0 |
added 60 characters in body
|
| S Dec 3, 2013 at 13:17 | history | suggested | Cryptographeur | CC BY-SA 3.0 |
LaTeX and newline; title to match question (although question in title was more interesting)
|
| Dec 3, 2013 at 13:13 | review | Low quality posts | |||
| Dec 3, 2013 at 13:18 | |||||
| Dec 3, 2013 at 13:07 | comment | added | CodesInChaos | Not always, but in practice it will often be even for relatively weak hashes $h_2$. The most important property required of $h_2$ is that preserves at least $2n$ bits of entropy, where $n$ is the target security level. (even that's not sufficient in pathological cases) | |
| Dec 3, 2013 at 13:04 | answer | added | poncho | timeline score: 2 | |
| Dec 3, 2013 at 13:02 | answer | added | Cryptographeur | timeline score: 3 | |
| Dec 3, 2013 at 13:01 | review | Suggested edits | |||
| S Dec 3, 2013 at 13:17 | |||||
| Dec 3, 2013 at 12:57 | history | asked | ax101 | CC BY-SA 3.0 |