I have the following requirement for hashing using MD5.
H(A,B,C,X);
Where values A,B & C are given. However X is not given.
I would like to find out what value of X would give a hash beginning with 32 1's bits
meaning H(A,B,C,X) = Begin with 32 '1' bits
I can brute force by testing all kinds of characters of X till i get 32 '1' bits.
however is there a faster way rather than doing this?