Answer the question
In order to leave comments, you need to log in
Is it possible to decrypt the usual MD5 hash of the number 0,... in two minutes?
There is an ordinary md5 hash from a regular number, let's say b363c8741f182e6830b1b979e7d9e734, it is initially known that the resulting number has 0 integers, for this hash specifically 0.900487363120953700, if it matters, then you can simply determine the first digit of the non-integer part, that is, 9. How is it possible to decrypt such a hash in 2 minutes? The brute force turns out to be very long, and I'm not sure what will happen. I suppose that it is possible by enumeration, only starting from a specific number, that is, 0.100000000000000000, here again there is a problem, because I don’t know if there are programs for enumerating from a certain number, and secondly, even here there are too many enumerations.
Answer the question
In order to leave comments, you need to log in
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question