Is there any research about cryptography on nondeterministic Turing machines?@CodesInChaos > I'd expect a straight forward proof that an attack against an encryption scheme on a non deterministic turing machine can't take longer than the legitimate operation on a normal machine. If you have a known plaintext, this is certainly the case. One interesting aspect is that the encryption operation itself might be infeasible on a standard machine.