Abstract
We develop a matrix-graph approach to the estimation of the communicative properties of a system of connected objects. In particular, this approach can be applied to analyzing the mixing properties of iterative cryptographic transformations of binary vector spaces, i.e. dependence of the output block bits on the input bits. In some applied problems, the saturation of the connections between the objects corresponds to the required level if the matrix modeling the connections or its certain submatrix is positive (the graph modeling the connections or its certain subgraph is complete). The concepts of local primitivity and local exponents of a nonnegative matrix (graph) are introduced. These concepts generalize and expand the area of application as compared to the familiar concepts of primitivity and exponent.We obtain a universal criterion for the local primitivity of a digraph and both a universal bound for the local exponents and its refinements for various particular cases. The results are applied to analyzing the mixing properties of a cryptographic generator constructed on the basis of two shift registers.
This is a preview of subscription content, log in via an institution to check access.
References
K. G. Kogos and V. M. Fomichev, “Positive Properties of NonnegativeMatrices,” Prikl. Diskretn. Mat. No. 4, 5–13 (2012).
S. N. Kyazhin and V. M. Fomichev, “On Primitive Sets of Natural Numbers,” Prikl. Diskretn. Mat. No. 2, 5–14 (2012).
S. N. Kyazhin and V. M. Fomichev, “Local Primitiveness of Graphs and Nonnegative Matrices,” Prikl. Diskretn. Mat. No. 3, 68–80 (2014).
L. Ya. Okunev, A Brief Course in Number Theory (Uchpedgiz, Moscow, 1956) [in Russian].
V. N. Sachkov and V. E. Tarakanov, Combinatorics of Nonnegative Matrices (TVP, Moscow, 2000; AMS, Providence, 2002)
J. L. R. Alfonsin, The Diophantine Frobenius Problem (Oxford Univ. Press, New York, 2005).
R. A. Brualdi and B. Liu, “Generalized Exponents of Primitive Directed Graphs,” J. Graph Theory 14, 483–499 (1990).
Y. Huang and B. Liu, “Generalized r-Exponents of Primitive Digraphs,” Taiwanese J. Math. 15 (5), 1999–2012 (2011).
B. Liu, “Generalized Exponents of Boolean Matrices,” Linear Algebra Appl. 373, 169–182 (2003).
Z. Miao and K. Zhang, “The Local Exponent Sets of Primitive Digraphs,” Linear Algebra Appl. 307, 15–33 (2000).
J. Shao, J. Wang, and G. Li, “Generalized Primitive Exponents with Complete Characterizations of the Extreme Digraphs,” Chin. Ann. Math. Ser. A, 15 (5), 518–523 (1994) [Chinese J. Contemp. Math. 15 (4), 317–324, 1994].
J. Shen and S. Neufeld, “Local Exponents of Primitive Digraphs,” Linear Algebra Appl. 268, 117–129 (1998).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.M. Fomichev, S.N. Kyazhin, 2017, published in Diskretnyi Analiz i Issledovanie Operatsii, 2017, Vol. 24, No. 1, pp. 97–119.
Rights and permissions
About this article
Cite this article
Fomichev, V.M., Kyazhin, S.N. Local primitivity of matrices and graphs. J. Appl. Ind. Math. 11, 26–39 (2017). https://doi.org/10.1134/S1990478917010045
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478917010045