Geodesic
To the task of description minimal by inclusion perfect ciphers
Prikladnaya Diskretnaya Matematika. Supplement, no. 14 (2021), pp. 91-95 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This work is dealing with the problem of description Shannon perfect ciphers (which are absolutely immune against the attack on ciphertext, according to Shannon), minimal by inclusion. A graph approach to the description of perfect ciphers and their modern analogues and generalizations is proposed. The equivalence graph of the keys of the cipher is defined. Key equivalence refers to the following: two different keys are equivalent in cipher-value $x_i$, if the cipher-value $x_i$ on these keys is encrypted to the same code designation. In this case, pairwise different keys $k_1, k_2, k_3,\ldots , k_{n-1}, k_n$ form a cycle of length $n$, if there is such a sequence of cipher-values that: 1) the neighboring cipher-values are different; 2) the keys $k_1, k_2, k_3,\ldots , k_{n-1}, k_n, k_1$ are sequentially equivalent in the corresponding cipher-values. If $n$ is an odd number, then the keys $k_1, k_2,\ldots , k_n$ form an odd-length cycle. A sufficient minimum inclusion condition of the cipher has been proven: let some inhomogeneously connected component of the equivalence graph of the keys of the cipher have an odd-length cycle, then the cipher is minimal by inclusion. Examples are given to illustrate the effectiveness of the proposed approach. The results can be used to study almost-perfect ciphers.
Keywords: perfect ciphers, endomorphic ciphers, non-endomorphic ciphers. 
@article{PDMA_2021_14_a20,
     author = {N. V. Medvedeva and S. S. Titov},
     title = {To the task of description minimal by inclusion perfect ciphers},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {91--95},
     year = {2021},
     number = {14},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2021_14_a20/}
}
TY  - JOUR
AU  - N. V. Medvedeva
AU  - S. S. Titov
TI  - To the task of description minimal by inclusion perfect ciphers
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2021
SP  - 91
EP  - 95
IS  - 14
UR  - http://geodesic.mathdoc.fr/item/PDMA_2021_14_a20/
LA  - ru
ID  - PDMA_2021_14_a20
ER  - 
%0 Journal Article
%A N. V. Medvedeva
%A S. S. Titov
%T To the task of description minimal by inclusion perfect ciphers
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2021
%P 91-95
%N 14
%U http://geodesic.mathdoc.fr/item/PDMA_2021_14_a20/
%G ru
%F PDMA_2021_14_a20
N. V. Medvedeva; S. S. Titov. To the task of description minimal by inclusion perfect ciphers. Prikladnaya Diskretnaya Matematika. Supplement, no. 14 (2021), pp. 91-95. http://geodesic.mathdoc.fr/item/PDMA_2021_14_a20/

[1] Shennon K., “Teoriya svyazi v sekretnykh sistemakh”, Raboty po teorii informatsii i kibernetike, Nauka, M., 1963, 333–402

[2] Alferov A. P., Zubov A. Yu., Kuzmin A. S., Cheremushkin A. V., Osnovy kriptografii, Gelios ARV, M., 2001

[3] Zubov A. Yu., Sovershennye shifry, Gelios ARV, M., 2003

[4] Zubov A. Yu., “Pochti sovershennye shifry i kody autentifikatsii”, Prikladnaya diskretnaya matematika, 2011, no. 4(14), 28–33 | Zbl

[5] Zubov A. Yu., “O ponyatii $\varepsilon$-sovershennogo shifra”, Prikladnaya diskretnaya matematika, 2016, no. 3(33), 45–52 | MR | Zbl

[6] Medvedeva N. V., Titov S. S., “Analogi teoremy Shennona dlya endomorfnykh neminimalnykh shifrov”, Prikladnaya diskretnaya matematika. Prilozhenie, 2016, no. 9, 62–65

[7] Medvedeva N. V., Titov S. S., “Opisanie neendomorfnykh maksimalnykh sovershennykh shifrov s dvumya shifrvelichinami”, Prikladnaya diskretnaya matematika, 2015, no. 4 (30), 43–55 | Zbl

[8] Medvedeva N. V., Titov S. S., “Geometricheskaya model sovershennykh shifrov s tremya shifrvelichinami”, Prikladnaya diskretnaya matematika. Prilozhenie, 2019, no. 12, 113–116

[9] Medvedeva N. V., Titov S. S., “Konstruktsii neendomorfnykh sovershennykh shifrov”, Prikladnaya diskretnaya matematika. Prilozhenie, 2020, no. 13, 51–54