News for hackers. Stuff that matters.
Re:How Hash Algorithms Work (2007) by contravariant on Friday January 13, 2017 @07:26AM (#13390281)
Not all operations are reversible, which makes it difficult to work out a simple inverse. Of course you could work backwards to find out which inputs could lead to a particular result, but this set of possible inputs would grow rapidly as you work your way back through the algorithm, making it nigh impossible to work out the original message, even if you have some idea what it's supposed to look like.

Of course this is assuming that the hash algorithm doesn't have any weaknesses you could exploit.

Re:How Hash Algorithms Work (2007) by dorfsmay on Friday January 13, 2017 @07:44AM (#13390370)
> Of course you could work backwards to find out which inputs could lead to a particular result

AKA rainbow tables, which explains why it is important not to use just a single word from the dictionary as a password.

https://en.wikipedia.org/wiki/Rainbow_table

Re:How Hash Algorithms Work (2007) by jessaustin on Friday January 13, 2017 @08:03AM (#13390469)
As explained in your link, rainbow tables make salts important. Imposing arbitrary requirements on users is misguided.