I'm searching an existing hash function or trying to make a hash function that has a lot of collisions.
Regularly a hash is used for it's ability to create unique hashes for hash tables or security purposes, but I desire the opposite. I desire a hash function that has allot of collisions. Preferably a simplistic hash function so finding a collision is easier/faster.
By the definition of a hash function. The hashes also have a predetermined length. I'd like a hash function that has this as a variable.
I'm new to this subject so I'm searching sources to create a hash function myself or candidate's that might fulfill the requirements.
If I have definition or terms wrong, please correct me.
h(x) = 0
would have a colliding hash for everything. More reasonably, you can take a good hash function and chop off unneeded bits until you get the desired collision rate.