News for hackers. Stuff that matters.
Re:SeaHash: Explained by thomasahle on Friday December 09, 2016 @10:07AM (#13139097)
> `f : {0,1}^n → {0,1}^n` is a perfect PRF if and only if given a distribution `d : {0,1}^n → [0,1]`, `f` maps inputs following the distribution `d` to the uniform distribution.

Is this even possible? If the distribution `d` always returns 0, how can a function make it uniform?

It would be nice, if the article would go into more details on how SeaHash obtains this property, and how it related to collision avoidance.

Re:SeaHash: Explained by petters on Friday December 09, 2016 @10:22AM (#13139195)
It's not clear what the author means here. This is not a very mathematical article.

(Nit: d is a distribution so it can not always return 0 -- it has to sum to 1. But your point stands.)

Re:SeaHash: Explained by pdpi on Friday December 09, 2016 @10:41AM (#13139307)
I believe the point is that you get a uniform distirbution of 1s and 0s after going through the PRF irrespectively of the distribution of 1s and 0s in the input. This is certainly a desirable property for a hash function.
Re:SeaHash: Explained by jamessb on Friday December 09, 2016 @10:38AM (#13139296)
A (translated) Dirac delta function might be a better example [1].

[1]: https://en.wikipedia.org/wiki/Dirac_delta_function