Hacker News new | ask | show | jobs
by ithinkso 1779 days ago
In cryptography either you only need 'an x', in cases that the original x does not matter, or if it does, then you can just as easily find all x of size less than large enough N and find 'the x', it is still solely restricted by time.

Laplace's demon, information loss, Landauer's principle etc. are at most tangentially related to the problem discussed

1 comments

You understand that isn't the same mathematically as reversing the hash? If you farm the set of all possible x and try them to see what works you do not have an inverse function in your hands.
> If you farm the set of all possible x and try them to see what works you do not have an inverse function in your hands.

I'm not sure I follow, what do I have then? Could you give me an example?