Timeline for Surjective hash functions $h:\{0,1\}^* \to \{0,1\}^{2n}$ with avalanche effect
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 9 hours ago | vote | accept | Dominic van der Zypen | ||
| 9 hours ago | comment | added | Carl Schildkraut | I think the following "silly example" works: begin with the map $h_0$ sending odd-size sets $[2n]$ and even-size sets to $\emptyset$. Then, enumerate the subsets of $[2n]$ of size at most $n$ as $S_1,\ldots,S_m$ and the subsets of $[2n]$ of size greater than $n$ as $T_1,\ldots,T_{m'}$. Finally, define $h$ to be $h_0$ except that $h([6k])=S_k$ and $h([6\ell+3])=T_\ell$ for each $k\in[m]$ and $\ell\in[m']$. | |
| 9 hours ago | answer | added | user527492 | timeline score: 3 | |
| 9 hours ago | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |