Sergey G. Brester
Sergey G. Brester
> An alternative fix for this would be to replace the line sha1.cpp#L198 No, then it would not fix basic issue within `SHA1_Transform`, it would fix `SHA1_Update` only. Either it...
> That is the only place it's called with inital data instead of a copy 1. unless it is used later somewhere else; 2. no matter, the handling in the...
If you meant this one - https://github.com/Cyan4973/xxHash Then as the description said: > Q.Score is a measure of quality of the hash function. It depends on successfully passing SMHasher test...
> What about a 7? what it is exactly?
Well, why do you not ask him? :) I assume some test-failures have there just fewer precedence...
> Is there a sound reason that h2 cannot use the same seed as h1 (even a transformation)? Yes, because the distribution is a bit "smoother" for data that are...
> If I want to build my own hash table ... how should I handle collisions...? You should put entries with same hash into some list, no matter which hash...
The case is - if your set, you want to put into table, is variable, you cannot really avoid collision without verifying of whole set or else without mathematical proof...
> That is no reason why the checksum should have collisions for short strings. There is no reasons to hash something shorter as 128 bit using 128-bit hash, unless your...
I hope you don't mean it in cryptographic sense, because MMH-3 function belongs not to the class of strong cryptography. It's a hash-function which primary role to provide a good...