Geodesic
On Construction of Perfect Ciphers
Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, no. 1 (2014), pp. 192-199.

Voir la notice de l'article provenant de la source Math-Net.Ru

K. Shannon in the 40s of the 20th century introduced the concept of a perfect cipher, which provides the best protection of plaintexts. Perfect secrecy means that cryptanalyst can obtain no information about the plaintext by observing the ciphertext. In the paper we study the problem of construction of perfect ciphers on a given set of plaintexts $X$, a set of keys $K$ and a probability distribution $P(K)$. We give necessary and sufficient conditions for a perfect ciphers on given $X$, $K$ and $P(K)$. It is shown that this problem is reduced to construction of the set of partitions of the set $K$ with certain conditions. As one of the drawbacks of the probability model of cipher are limitations on the power of sets of plaintexts, keys and ciphertexts we also study the problem of construction of substitution cipher with unbounded key on a given set of ciphervalues, a set of keys and a probability distribution on the set of keys.
Keywords: cipher, perfect cipher, set of keys, probability distribution. 
@article{VSGTU_2014_1_a16,
     author = {S. M. Ratseev},
     title = {On {Construction} of {Perfect} {Ciphers}},
     journal = {Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences},
     pages = {192--199},
     publisher = {mathdoc},
     number = {1},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VSGTU_2014_1_a16/}
}
TY  - JOUR
AU  - S. M. Ratseev
TI  - On Construction of Perfect Ciphers
JO  - Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences
PY  - 2014
SP  - 192
EP  - 199
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VSGTU_2014_1_a16/
LA  - ru
ID  - VSGTU_2014_1_a16
ER  - 
%0 Journal Article
%A S. M. Ratseev
%T On Construction of Perfect Ciphers
%J Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences
%D 2014
%P 192-199
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VSGTU_2014_1_a16/
%G ru
%F VSGTU_2014_1_a16
S. M. Ratseev. On Construction of Perfect Ciphers. Journal of Samara State Technical University, Ser. Physical and Mathematical Sciences, no. 1 (2014), pp. 192-199. http://geodesic.mathdoc.fr/item/VSGTU_2014_1_a16/

[1] A. P. Alferov, A. Yu. Zubov, A. S. Kuz'min, A. V. Cheremushkin, Osnovy kriptografii [Foundations of Cryptography], Helios, Association of Russian Universities, Moscow, 2005, 480 pp. (In Russian)

[2] C. E. Shannon, “Communication Theory of Secrecy Systems”, Bell System Technical Journal, 28:4 (1949), 656–715 ; K. Shennon, “Teoriya svyazi v sekretnykh sistemakh”, Raboty po teorii informatsii i kibernetike, Inostrannaya literatura, M., 1963, 333–369 | DOI | Zbl

[3] S. M. Ratseev, “About perfect imitation resistant ciphers”, Prikl. Diskr. Mat., 2012, no. 3, 41–46 (In Russian)

[4] A. Yu. Zubov, Kriptograficheskie metody zashchity informatsii. Sovershennye shifry [Cryptographic methods of information protection. Perfect codes], Helios, Association of Russian Universities, Moscow, 2005, 192 pp. (In Russian)

[5] S. M. Ratseev, “On optimal authentication code”, Sistemy i Sredstva Inform., 23:1 (2013), 53–57 (In Russian)