The only way to "break" correctly working hashes is to encrypt tons of passwords (+salt) and see if the lossy output is identical to the output you got from the previously hashed password.
Which is a very time consuming and computably expensive process (in particular when using something newer/better than MD5/3DES).
The question is - can we predict these collisions or guestimate when they might occur without having to actually try every combination? If the answer is "yes" then the hashing algorithm is broken (see MD5).
http://www.freebsd.org/doc/handbook/crypt.html
See this: http://en.wikipedia.org/wiki/One-way_compression_function#Co...
I can't blame companies for not having one such on hand to begin with, but I'm sure they'd appreciate that someone with the unfortunate experience crafted a draft for them in stressful times like these.
For example "bitter sweet." Bitter and sweet mean two different opposite things, but the two words together are "true" because something can be both bitter and sweet.
Encryption means simply to convert information into a form which cannot be easily read by an unauthorised party. One way or lossy encryption is not a contradiction of that.
Further, "one way encryption" appears to only exist so nobody has to explain to regular users (and a lot of developers apparently) what is actually being done with their passwords.