Biletskyi O. Methods of symmetric information security cryptographic algorithms creation with dynamic controlled primitives

This dissertation work has solved actual scientific problem of development symmetrical cryptographic algorithms with dynamic parameters and matrix based protocol of key distribution. In this work we've proposed a new class of symmetrical block algorithm named RSB (Round, Step, Block). The distinctive feature of RSB is so called "sliding coding" operation, which brings great permutation of open text as well as participates in round key generation algorithm. Because of that, all cryptographic operations parameters became dependent not only on secret key but on content of open text. "Sliding coding" operation is based on common Grey's transformations, in so called "otherwise" form. The "othewise" form means that forward "slide coding" is backward Grey's coding and otherwise. Through primitive of "slide coding" the RSB gives good statistical charectistics of cryto text already with 2 rounds of cryptographic transformations, in the same time known algorithms AES, GOST gives same result for 4 and more rounds. We have improved classical SP-transformation with operation of stochastic shift, which gives ability to create new types of SPS generators. Besides of that, based on Galois and Fibonachi generic matricies, we've developed algorithms of session keys generators. Despite of know algorithms Diffie-Hellman and Erosha-Skuratova, proposed algorithm is protected from "man in the middle" attack.