21 reputation
1
bio website
location
age
visits member for 1 year, 2 months
seen Aug 24 '13 at 21:36

Aug
20
comment Is there any research about cryptography on nondeterministic Turing machines?
@D.W. Given that there are useful cryptosystems where one plaintext can be encoded as many differnt possible cyphertexts, it seems to me like the natural answer is that if more than one trace accepts, the output from a randomly selected trace is used.
Aug
15
comment Is there any research about cryptography on nondeterministic Turing machines?
@CodesInChaos I'm aware that a nondeterministic Turing machine is way more powerful than a quantum computer, but "post-post-quantum-cryptography" wasn't a tag.
Aug
15
comment 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.
Aug
15
revised Is there any research about cryptography on nondeterministic Turing machines?
Added more tags.
Aug
15
comment Is there an algorithm or hardware that can sign/verify natural time?
There are various Lamport clock protocol variants that are resilient against untrustworthy peers. If you combine the protocol of cs.dartmouth.edu/~sws/pubs/thesis.pdf with the encryption primatives of fkerschbaum.org/icpads07.pdf you get something that is a lot like cryptographically signed timestamps and that doesn't require a whole lot of trust of the peers.
Aug
14
awarded  Student
Aug
14
asked Is there any research about cryptography on nondeterministic Turing machines?
Aug
14
answered Is there an algorithm or hardware that can sign/verify natural time?