Brilliant. The following proposition shall henceforth be known as the Churchill-Turing thesis: "Every insufficiently random symmetric-key scheme can be success

Brilliant. The following proposition shall henceforth be known as the Churchill-Turing thesis: "Every insufficiently random symmetric-key scheme can be successfully cryptanalyzed given a sufficiently long ciphertext." Of course an entirely different matter is whether said scheme can be feasibly cryptanalyzed, but I digress.