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). ...

...The resulting hash will be ~2x the message block in size, and should provide for at least as many bits of security as the block itself. I updated this, with a different hash than original, since I found a potential collision on some blocks, not but specific to that challenge. To further correct this, I modified the padding when it's less than the block size. I hold no guarantee of the security of this algorithm, USE AT YOUR OWN RISK. I have had no 3rd party analysis done on the algorithm to date, but research is welcome, and a challenge is even provided in CHALLENGE.txt.

distDES is a Java RMI-based application which manages load balancing on heterogeneous clusters. Development will extend the theoretical initial implementation to include clustered Rainbow Table generation and encryption algorithm collision detection.

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