Answer by Ray Morris for Cryptography based on uncomputable problems?
It is certainly conceivable. The big issue is, most undecidable problems are of the form "create an algorithm which, for all possible inputs ...". Many of these problems are easy to solve for many...
View ArticleAnswer by Hermit for Cryptography based on uncomputable problems?
assuming you have encryptionvthat has a pass phrase then you can go no higher, but what if there is no pass phrase and everything is operated on and evaluated WHILE it is in it's encrypted state? An...
View ArticleAnswer by tsen for Cryptography based on uncomputable problems?
It is impossible to build a cryptographic algorithm using uncomputable problems because you cannot compute them. It would be impossible to execute the encryption. In order to use a problem for...
View ArticleAnswer by Mikero for Cryptography based on uncomputable problems?
Encryption, signatures, etc., can always be broken in NP.You can break any encryption scheme if you can solve the following decision problem: "does there exist a secret key and encryption randomness...
View ArticleCryptography based on uncomputable problems?
A lot of cryptography is based on the assumption that ${\sf P} \neq {\sf NP}$.Is it conceivable to construct a cryptography system based on a class of much harder problems than ${\sf NP}$-problems,...
View Article
