Re:Bloom Filters by Example
by sk5t on Tuesday July 11, 2017 @12:15AM
(#14741537)
sha1 is very, very fast. This article seems to confuse cryptographically useful hash functions with key stretching, adaptive work hashing, and the like.
[ Parent
| on HN ]
There are no comments on this comment yet.