naivenom / hash-collision-attack

A Hash Collision Attack is an attempt to find two input strings of a hash function that produce the same hash result. Because hash functions have infinite input length and a predefined output length, there is inevitably going to be the possibility of two different inputs that produce the same output hash. If two separate inputs produce the same …
12Updated 7 years ago

Alternatives and similar repositories for hash-collision-attack:

Users that are interested in hash-collision-attack are comparing it to the libraries listed below