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, namely undecidable problems such as the mortal matrix problem?