> And isn't there the possibility of collisions, so that even if you find a string that maps to the same hash, it might not be the original password? Not reall

> And isn't there the possibility of collisions, so that even if you find a string that maps to the same hash, it might not be the original password? Not really. 2^128 is a stupefyingly big number. We'll likely never find a random collision in MD5. We know how to generate collisions in MD5, but this requires knowing the preimage (e.g., the m in `h = H(m)`).