I need to design a hash function such that it is possible to enumerate all possible 'candidate' input strings (preimages) for a given hash (image). It must otherwise be a normal hash function [i.e. small differences in input (preimage) --> large difference in hash (image) ]
Does this already exist? If so, what's it called, and if not, how would I go about designing one?
Cheers, a.