|
Embedding of provably unsolvable problems into stream ciphers
F. M. Malyshev Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Abstract:
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.
Key words:
ciphers, cryptographic strength, recursively enumerable sets, recursive functions, non-recursive sets.
Received 12.V.2022
Citation:
F. M. Malyshev, “Embedding of provably unsolvable problems into stream ciphers”, Mat. Vopr. Kriptogr., 14:1 (2023), 65–83
Linking options:
https://www.mathnet.ru/eng/mvk432https://doi.org/10.4213/mvk432 https://www.mathnet.ru/eng/mvk/v14/i1/p65
|
|