Somewhat unexpectedly, a near consensus among theoreticians is that cryptographic theorems should be proved in the non-uniform model of complexity, rather than the standard uniform complexity model developed by Alan Turing, the “father of computer science.” In joint work with Alfred Menezes of the University of Waterloo, we have criticized the use of non-uniformity in cryptography, finding that even some of the most distinguished researchers have been led badly astray by their misplaced faith in non-uniformity