|
Vestnik SamGU. Estestvenno-Nauchnaya Ser., 2013, Issue 9/1(110), Pages 42–48
(Mi vsgu398)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Mathematics
On perfect imitation resistant ciphers of substitution with unbounded key
S. M. Ratseev The Dept. of Information Security and Control Theory, Ulyanovsk State University, Ulyanovsk, 432017, Russian Federation
(published under the terms of the Creative Commons Attribution 4.0 International License)
Abstract:
Constructions of perfect imitation resistant ciphers are investigated in the work. It is well known that Vernam cipher with equiprobable gamma is a perfect cipher but it is not imitation resistant. It is because in Vernam cipher equipotent alphabets for plaintexts and ciphertexts are used. On the basis of A. Yu. Zubov's mathematical model of substitution cipher with unbounded key a model of perfect and imitation resistant cipher is constructed. At that reference cypher of the given model is perfect and reaches lower boundaries for success probability of imitation and substitution of communication.
Keywords:
cipher, perfect cipher, imitation of communication.
Received: 23.09.2013
Citation:
S. M. Ratseev, “On perfect imitation resistant ciphers of substitution with unbounded key”, Vestnik Samarskogo Gosudarstvennogo Universiteta. Estestvenno-Nauchnaya Seriya, 2013, no. 9/1(110), 42–48
Linking options:
https://www.mathnet.ru/eng/vsgu398 https://www.mathnet.ru/eng/vsgu/y2013/i91/p42
|
Statistics & downloads: |
Abstract page: | 493 | Full-text PDF : | 54 | References: | 33 |
|