Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования

DOI10.4213/mvk432zbMath1519.94172WikidataQ123338585 ScholiaQ123338585MaRDI QIDQ6167582

Fedor M. Malyshev

Publication date: 7 August 2023

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk432

zbMATH Keywords

recursive functionsrecursively enumerable setsciphersnon-recursive setscryptographic strength

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum computational networks
• Universal diophantine equation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The number of certain integral polynomials and nonrecursive sets of integers, Part 2
• A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory
• DIOPHANTINE SETS

This page was built for publication: Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования