СОВРЕМЕННЫЕ ПРОБЛЕМЫ КОМПЬЮТЕРНЫХ И ИНФОРМАЦИОННЫХ НАУК, IV Международная научная конференция «Конвергентные когнитивно-информационные технологии»

Размер шрифта: 
SELECTION OF PARAMETERS OF MULTIDIMENSIONAL MATRICES FOR THE GENERALIZED AFFINE HILL CIPHER
Виктор Иосифович Мунерман, Евгений Гончаров, Татьяна Аркадьевна Самойлова

Изменена: 2019-11-14

Реферат


The article presents a generalization of Affine Hill Cipher to the algebra of multidimensional matrices. Operations in the algebra of multidimensional matrices include all operations on the algebra of flat matrixes as a special case. A generalization of the matrix multiplication is the folded (λ, µ)-product, the result of which depends not only on the multidimensional matrices used in the operation, but on their partition of the indices. The parameters of multidimensional matrices can be chosen in such a way that the folded (λ, µ)-product is associative. The article presents a method for selecting parameters of multidimensional matrices, for which the folded (λ, µ)-product is associative. This makes it possible to generalize Hill Cipher and its modifications to the algebra of multidimensional matrices in a natural way. In the coding system is used not flat, but multidimensional matrices. The variability of the choice of their parameters is a qualitative complication of the Hill Cipher. The article presents a method for constructing such a multidimensional matrix that for it there will always be a unique inverse with respect to the chosen partition. Using it, it is always possible to construct a coding system. The dependence of the number of operations to create a coding system, the time for coding and decoding on the choice of indexes for partitioning multidimensional matrices was investigated. The article quantifies the crypto-stability of the proposed algorithm for the following types of attacks: ciphertext-only attack, known-plaintext attack, chosen-plaintext attack, chosen-ciphertext attack. The generalization on the algebra of multidimensional matrices makes it possible to qualitatively increase the cryptoresistance of the Affine Hill Cipher by virtue of the specificity the folded (λ, µ)-product of multidimensional matrices, the variability of the choice of partitioning, the choice of dimensions and the order of matrices from the coding system.