Embedding of provably unsolvable problems into stream ciphers

In view of intensively developing theories of quantum cryptography and of quantum computers, the possibility to construct ciphers with a potentially infinite set of cryptographic keys based on recursively enumerable, but not recursive sets is discussed.