ON PERFECT IMITATION RESISTANT CIPHERS BASED ON COMBINATORIAL OBJECTS


Cite item

Abstract

We study perfect imitation resistant ciphers, highlighting particularly the case in which the probabilities of successful imitation and substitution attain their lower limits. On the basis of A.Yu. Zubov’s mathematical model of substitution cipher with unbounded key model of perfect and imitation resistant cipher based on combinatorial objects is constructed.

About the authors

S. M. Ratseev

Department of Information Security and
Control Theory, Ulyanovsk State University, 42, Lev Tolstoy Street, Ulyanovsk, 432017, Russian
Federation.

Author for correspondence.
Email: morenov.sv@ssau.ru

V. M. Ratseev

Department of Telecommunication Technologies and Networks, Ulyanovsk State University, 42, Lev Tolstoy Street, Ulyanovsk, 432017, Russian Federation.

Email: morenov.sv@ssau.ru

References

  1. Zubov A.Yu. Kriptograficheskie metody zashchity informatsii. Sovershennye shifry . M.: Gelios ARV, 2005 .
  2. Ratseev S.M. O postroenii sovershennykh shifrov . Vestn. Samar. Gos. Tekhn. Un-ta. Ser. Fiz.-Mat. Nauki , 2014, no. 1(34), pp. 192–199 .
  3. Ratseev S.M. O sovershennykh imitostoikikh shifrakh zameny s neogranichennym kliuchom . Vestnik Samarskogo Gosudarstvennogo Universiteta , 2013, no. 9/1 (110), pp. 42–48 .
  4. Ratseev S.M. Nekotorye obobshcheniia teorii Shennona o sovershennykh shifrakh . Vestn. IuUrGU. Ser. Matem. modelirovanie i programmirovanie , 2015, no. 1(8), pp. 111–127 .

Copyright (c) 2017 С. М. Рацеев, В. М. Рацеев

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies