| Cellular-automaton algorithm of matrices permutation with an oscillatory scheme of element shift |
|
 |
|
|
| Authors |
| | Rubis P.D. |
| | Matyushkin I.V. |
| Date of publication |
| | 2021 |
| DOI |
| | 10.31114/2078-7707-2021-3-26-33 |
|
| Abstract |
| | Numerical calculation uses to describe the operation of matrix permutation algorithm based on cyclic shifts of rows and columns. Scope of the algorithm is the group generation of pseudorandom numbers. Algorithm formulates in terms of cellular automata (CA). Results of numerical calculation are given, primarily for the repetition period of the original matrix. For even-order matrices, the period is linear or quadratic. In case of matrices with odd order, the dependence of the algorithm period from the order of the matrix is recurrent, obtained in the form of list of rules, and does not exceed the Landau function. Visualization of individual pathes of matrix elements is presented on the expanded field of the CA. As a parameter of the global dynamics of automata , two "mixing metrics" are analyzed on the permutations of the matrix (compared to the initial one). The behavior of these metrics shows in graphs and histograms (conditional density distribution) describing how often the permutation period occurs with the specified interval of metrics. |
| Keywords |
| | cellular automata, permutation, random numbers, cryptography, metric |
| Library reference |
| | Rubis P.D., Matyushkin I.V. Cellular-automaton algorithm of matrices permutation with an oscillatory scheme of element shift // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2021. Issue 3. P. 26-33. doi:10.31114/2078-7707-2021-3-26-33 |
| URL of paper |
| | http://www.mes-conference.ru/data/year2021/pdf/D004.pdf |
