Answer the question
In order to leave comments, you need to log in
Is it possible to decrypt md5 hash for 30 characters?
Good afternoon, there is a password of 30 (yes, scribe) characters, but the first 13 are known to me. And it only consists of numbers. How to calculate the power of iron, on which it can really be broken, with a successful operation, any costs will pay off) Thank you
Answer the question
In order to leave comments, you need to log in
I can draw an analogue with a brute wifi. labor costs for iron are approximately identical. 10^17 , weak percent of 2009, i3 2-3 will iterate over 300 conventional hashes. and then it will take 3858024691 days or 10569930 years approximately. processors are weak in this regard, a 550i video card of the same year will take about 3-4k hashes per second. and on this video card it will take 792744 years. the performance of newer graphics cards is much higher. in the region of 200-400k operations. quite possibly up to a million. Let's take 400k then you will need about 10 similar video cards to sort out this value in 800 years. With such a number of operations, the difference in the complexity of calculations with my analogy strongly depends. But it's not that big for the concept of scale, I think.
On the wiki they write that there is an algorithm that calculates MD5 collisions in 1 minute.
And you, in fact, do not need the password itself, any text that gives the same hash is enough, I think so.
Md5 is irreversible encryption.
Only by enumeration.
When encrypting, they almost always use a “salt” and it is also possible that md5 was encrypted in md5 ....
There is no point in doing this.
Didn't find what you were looking for?
Ask your questionAsk a Question
731 491 924 answers to any question