Search Results for "collision"

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

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.