Abstract
We develop amatrix-graph approach to estimating themixing properties of bijective shift registers over a set of binary vectors. Such shift registers generalize, on the one hand, the class of ciphers based on the Feistel network and, on the other hand, the class of transformations of additive generators (the additive generators are the base for the Fish, Pike, andMush algorithms). It is worth noting that the original schemes of additive generators are found insecure due to their weak mixing properties. The article contains the results of investigations for the mixing properties of modified additive generators. For the mixing directed graph of a modified additive generator, we define the sets of arcs and cycles, obtain primitivity conditions, and give a bound for the exponent. We show that, the determination of parameters for the modified additive generator allows us to achieve a full mixing in a number of iterations that is substantially less than the number of vertices in the mixing digraph.
This is a preview of subscription content, log in via an institution to check access.
References
A. M. Dorokhova and V. M. Fomichev, “Revised Values of Exponents for Mixing Graphs of Bijective Shift Registers over a Set of Binary Vectors,” Prikl. Diskretn. Mat. No. 1, 77–83 (2014).
K. G. Kogos and V. M. Fomichev, “Positive Properties of NonnegativeMatrices,” Prikl. Diskretn. Mat. No. 4, 5–13 (2012).
A. M. Koreneva and V. M. Fomichev, “On a Feistel BlockCipherGeneralization,” Prikl. Diskretn. Mat. No. 3, 34–40 (2012).
S. N. Kyazhin and V. M. Fomichev, “Local Primitiveness of Graphs and Nonnegative Matrices,” Prikl. Diskretn. Mat. No. 3, 68–80 (2014).
V. N. Sachkov and V. E. Tarakanov, Combinatorics of nonnegative matrices (TVP, Moscow, 2000; AMS, Providence, 2002).
V. M. Fomichev, Methods of Discrete Mathematics in Cryptology (Dialog-MIFI, Moscow, 2010) [in Russian].
V. M. Fomichev, “Properties of Paths in Graphs and Multigraphs,” Prikl. Diskretn. Mat. No. 1, 118–124 (2010).
V. M. Fomichev, “The Estimates for Exponents of Primitive Graphs,” Prikl. Diskretn. Mat. No. 2, 101–112 (2011).
V. M. Fomichev, “An Estimate of Exponent of Some Graphs by Means of Frobenius’s Numbers of Three Arguments,” Prikl. Diskretn. Mat. 24 (2), 88–96 (2014).
B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C (Wiley, New York, 1996; Triumf, Moscow, 2002).
B. M. Kim, B. C. Song, and W. Hwang, “Nonnegative PrimitiveMatrices with Exponent 2,” Linear Algebra Appl. 407, 162–168 (2005).
B. L. Shader and S. Suwilo, “Exponents of Nonnegative Matrix Pairs,” Linear Algebra Appl. 363, 275–293 (2003).
H. Wielandt, “Unzerlegbare, nicht negative Matrizen,” Math. Z. 52, 642–648 (1950).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.M. Koreneva, V.M. Fomichev, 2017, published in Diskretnyi Analiz i Issledovanie Operatsii, 2017, Vol. 24, No. 2, pp. 32–52.
Rights and permissions
About this article
Cite this article
Koreneva, A.M., Fomichev, V.M. Mixing properties of modified additive generators. J. Appl. Ind. Math. 11, 215–226 (2017). https://doi.org/10.1134/S1990478917020077
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478917020077