V.G. Babenko, O.G. Melnyk, O.B. Nesterenko

Annotations languages:

In this article we synthesized mathematical model of multiple transformation matrix operations based on the sliding encryption primitive. Based on the use of the obtained recurrent dependencies describing models of multiple execution of sliding encryption primitive built a generalized recurrent model of implementation of multiple primitive sliding encryption for transforming n elements. Using synthesized on the basis of mathematical models of recurrent dependencies four-, five- and sixelement forward right-primitive sliding encryption produced a generalized expression of recurrent sequence to describe of the multiple perform of sliding encryption primitive for a given number of elements. This paper proposes an approach relatively the mathematical description based on recurring sequences model transformation operations based on the multiple use of sliding encryption primitive with a limited number of elements.