Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования (Q6167582): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4187781 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3924153 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: DIOPHANTINE SETS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Universal diophantine equation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The number of certain integral polynomials and nonrecursive sets of integers, Part 2 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum theory, the Church–Turing principle and the universal quantum computer / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quantum computational networks / rank | |||
Normal rank | |||
Latest revision as of 12:13, 2 August 2024
scientific article; zbMATH DE number 7723404
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования |
scientific article; zbMATH DE number 7723404 |
Statements
Embedding of provably unsolvable problems into stream ciphers;Встраивание доказуемо неразрешимых задач в шифры гаммирования (English)
0 references
7 August 2023
0 references
ciphers
0 references
cryptographic strength
0 references
recursively enumerable sets
0 references
recursive functions
0 references
non-recursive sets
0 references
