Do different types of hashes take varying amounts of time to crack?

[Oddysee]

Hi All,

I recently used ocl hashcat to crack an ecryptfs hash, the password was relativly simple a word and a numeric value and using a dictionary roughly 4GB in size it took approximately 5 days to crack. I'm currently trying to crack an NT hash and have built a 60GB dictionary to handle the potential complexity of the password. Yet ocl hashcat takes about 11 minutes to exhaust the list. I don't understand why it's taking less time to process more data, does the type of hash have something to do with this?

[Flomac]

The simple answer is yes. The hash has a lot to do with it. With simple types of hashes you can get billions of tries per second (thats why they're called fast hashes e.g. MD5, NTLM), but with more secure ones you fall back into millions, thousands or even hundreds (e.g. WPA, bcrypt).

You can perform a benchmark with your card (option -b) and see how fast it'll be at which type of hash.

[Oddysee]

The simple answer is yes. The hash has a lot to do with it. With simple types of hashes you can get billions of tries per second (thats why they're called fast hashes e.g. MD5, NTLM), but with more secure ones you fall back into millions, thousands or even hundreds (e.g. WPA, bcrypt).

You can perform a benchmark with your card (option -b) and see how fast it'll be at which type of hash.

Thank you Flomac for getting back to me so quickly That's very interesting and good to know