Four Cellular Automata Algorithms for Matrix Permutation

Four Cellular Automata Algorithms for Matrix Permutation

Numerical calculation uses to describe the operation of matrix permutation algorithms based on cyclic shifts of rows and columns. This choice of discrete transformation algorithms justified by the convenience of the cellular automaton (CA) formulation, which is used. Obtained Empirical formulas for...

Full description

Bibliographic Details
Main Authors: I. V. Matyushkin, P. D. Rubis
Format: Article
Language:Russian
Published: MGTU im. N.È. Baumana 2020-12-01
Series:Matematika i Matematičeskoe Modelirovanie
Subjects:
cellular automata
permutation
random numbers
cryptography
metric
Online Access:https://www.mathmelpub.ru/jour/article/view/223

Similar Items

Similar Items