Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Could it be like a lock pick process where you start from the left and see if you get further or can throw away that guess, so by having the "choices" be at the beginning you don't have to make them again and again? (and for whatever reason doesn't/can't cache the prefix)? Or could it be like when counting

     100000000000
     010000000000
     110000000000
     001000000000
most of the variation is at the left and you only rarely see changes at the right? Would be interesting to get this answer from from someone who knows hashcat and isn't just pulling answers out of the air like me :)


Hashing is specifically done to prevent just this. (Just reacting to the comment here, haven't grokked the specifics.)


That just makes it even more confusing that it uses longer to vary the right than the left – is the specific hash algorithm used not "balanced" (or whatever the term of art is) the way it ideally/theoretically should be?




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: