Hacker News new | ask | show | jobs
by heyjudy 2679 days ago
Just use that GPU power to generate rainbowtables once which then can use the space/time tradeoff to perpetually find passwords in seconds without a GPU. Bruteforcing one hash at a time is pointlessly wasteful if you have the storage.
1 comments

Except under standard industry practices each hashed password has a unique salt.
How much storage would hashing every combo with every salt take? Is it still possible?
A rainbow table for 8 chars would be 50-100 TB. If you add a 8-byte salt to each password multiply that number with 256^8
NTLM doesn't use a salt. It's 128 bits. That's within the realm of nation states and there's at least one public sparse NTLM rainbow table. And I said, "if you have the storage," which you dishonestly ignored. Nice try, bucko. Got any more red herrings that aren't relevant?