How Hash Algorithms Work (2007)

Re:How Hash Algorithms Work (2007) by clishem on Friday January 13, 2017 @08:48AM (#13390702)

> If you are given the value of what 'cat' hashes too but you didn't know what made it, you would never be able to find out that 'cat' was the original word.

This is false or inaccurate at best too. More correct would be that it should be computationally infeasible for any one entity to have any reasonable chance to obtaining the inverse of a hash, in the foreseeable future.

With all hashing functions in existence, it's always theoretically possible to find the inverse, and that should be pointed out.

[ Parent | on HN ]

Re:How Hash Algorithms Work (2007) by JohnStrange on Friday January 13, 2017 @12:23PM (#13392562)

Not only that it's also false from a practical perspective because you can easily find out that 'cat' was the original word by going through a list of hashes of all English words (>rainbow table attacks). That's why you use salts.

[ Parent | on HN ]

Re:How Hash Algorithms Work (2007) by fooza on Friday January 13, 2017 @01:03PM (#13392945)

Only now I understand why people use (sic)

[ Parent | on HN ]