There's a huge difference between knowing the name of something and knowing something.
We talk in fact-deficient, obfuscating generalities to cover up our lack of understanding.
"Before everything else, getting ready is the secret of success.” – Henry Ford
Join us for the biggest digital agency summit and get ready to take your business to the next level with the sessions we have lined up: https://t.co/LFSJkbd9nE
Check out @DavidMainayar's session tmrw
Cryptography problem: make an invertible, easy-in-both-directions function from [0...2^256 - 1] to [0...2^256 - 2] (or more generally, -k for small k) where the exceptions to the invertibility are computationally infeasible to find.
Has there been any work on this?