Search Results for "collision"

...The latest variant, XXH3, offers improved performance across the board, especially on small data. It successfully completes the SMHasher test suite which evaluates collision, dispersion and randomness qualities of hash functions. Code is highly portable, and hashes are identical across all platforms (little / big endian). Performance on large data is only one part of the picture. Hashing is also very useful in constructions like hash tables and bloom filters. In these use cases, it's frequent to hash a lot of small data (starting at a few bytes). ...

This project conducts collision tests on many hash functions, trying to find options for those interested in leaving SHA-1 (which is kind of imperative these days). Tests are conducted on a per-environment basis, so that each environment will produce some specific results. Also, user can choose criterion such as: * attempts per second; * collision attempts per max attempts supported; and * power consumption.

Utilities for measuring characteristics of cryptographic hash functions: avalanche property, (partial) collision search, Maurer's universal statistical test, Filiol's Mobius ANF statistical analisys. EdonC, EdonR, MD5 and SHA-1 hash-plugins included.

I needed a library of functions that enabled me to perform hash functions and symmetric cryptography. I chose MD5 initially but eventually chose SHA as the hashing algorithm due to concerns regarding the \'collision resistance\' of MD5 due to weakne