UCLA computer grad constructs “crown jewel of cryptography”
That is a fascinating result. A remarkable mathematical achievement. And a nightmare.<p>This thesis says that it's possible to obfuscate code in such a way that there is a lower bound on the level of effort needed to de-obfuscate it. That lower bound can apparently be comparable to the level of effort required to break a cryptosystem.<p>So, coming soon, viruses and worms nobody can figure out. Code where no one can tell if it has a backdoor. ML classifiers where no one can be sure what they really do.