The 2007 Godel Prize for outstanding papers in theoretical computer science at the ACM Symposium on Theory of Computing honours two computer scientists, Alexander A. Razborov and Steven Rudich, for proving that there is no "Natural Proof" that certain computational problems in cryptography are hard to solve, and though they are thought to be unbreakable, there is no natural proof that they are secure.
Razborov, a mathematician and computational theorist, is a leading researcher at the Russian Academy of Science Steklov Mathematical Institute in Moscow, Russia. Rudich is Associate Professor of Computer Science at Carnegie Mellon University in Pittsburgh, Pa., an editor of the Journal of Cryptology - and accomplished magician. (Source)