3 ms·
While "This phrase is definitely not in the dictionary" is true, every component is. If this sort of password became popular brute forcing passwords would just
by Volpe 14y ago
While "This phrase is definitely not in the dictionary" is true, every component is. If this sort of password became popular brute forcing passwords would just start using whole word combinations when cracking passwords. i.e a word becomes the equivalent of a character (though from a larger set of characters).
Also wouldn't a hash of a long passphrase be longer? (I am completely ignorant the details of hashing algorithms)... so if I'm cracking a table of hashed passwords, I could set a "passphrase" cracker on hashed passwords of above average length?
- rudedogg 14y agoNo, the hash is always the same length, a single character and a 4GB movie will generate a hash of the same length (using the same hash algorithm (md5, sha512, etc). I've casually read about it, I think that is the point of the hash, to take an input of any size or length and represent it as a fixed size. The problem with this is hash collisions, weaknesses found in hash algorithms can make it so attackers could generate files to match another files hash (or password or w/e). I think the idea is that they create a harmful file, then add null characters or w/e so the hash algorithm will generate/assign the two different files the same hash.
- ajanuary 14y agoThe key idea behind any hashing algorithm is to take inputs of any length and turn them into an output of a fixed length. Different problem domains have different additional requirements: password hashes want to minimise collisions (multiple inputs hashing to the same output), checksums want to make similar inputs produce wildly different outputs, hashtable/dictionary/map key hashes want to create an even distribution of outputs etc. But the thing common to all hashing algorithms is the output is the same size.