News for hackers. Stuff that matters.
Re:Why you shoud never use your favorite password on News.YC... by orib on Saturday May 31, 2008 @09:15PM (#205548)
You are. One of the defining properties of a cryptographic hash is that you cannot easily deduce the input given the output, nor can you easily construct an input to produce a given output. (see the overview at http://en.wikipedia.org/wiki/Cryptographic_hash)

However, it's still possible to do a dictionary attack on the database of hashes ("is the hash of "password" the same as the user's password hash? yes? Bingo!")

Re:Why you shoud never use your favorite password on News.YC... by eru on Sunday June 01, 2008 @04:20AM (#205753)
You should use individual salting for each password to make this at least a bit more difficult.
Re:Why you shoud never use your favorite password on News.YC... by rw on Saturday May 31, 2008 @09:51PM (#205573)
Provided, of course, that P != NP.
Re:Why you shoud never use your favorite password on News.YC... by tptacek on Saturday May 31, 2008 @10:19PM (#205583)
Message digest functions are not, generally, number-theoretic.
Re:Why you shoud never use your favorite password on News.YC... by cperciva on Saturday May 31, 2008 @11:41PM (#205620)
How is this relevant? The question of P ?= NP isn't limited to number-theoretic functions -- if P = NP then it is possible to find a preimage to any (polynomial time) hash function in polynomial time.
Re:Why you shoud never use your favorite password on News.YC... by tptacek on Saturday May 31, 2008 @11:44PM (#205623)
You're right.