I have the following requirement for hashing using MD5.


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?

closed as off topic by Rory Alsop Nov 4 '12 at 17:21

Questions on Information Security Stack Exchange are expected to relate to Information security within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here. If this question can be reworded to fit the rules in the help center, please edit the question.

  • Don't cross-post on different SE sites please. – CodesInChaos Nov 4 '12 at 17:11
  • Closed as off topic - your cross-post on Crypto is more appropriate there. – Rory Alsop Nov 4 '12 at 17:22

Browse other questions tagged or ask your own question.