In this work Binary Galois field GF(2m) elements multipliers structural complexity and its components decreasing has investigated. Elements of fields are represented in the normal basis of type 2. The degree of the field is less then 998.
[1] M. V. Cherkaskyy. Complexity interdependence characteristics and reliability of computer systems [Text] / M. V. Cherkaskyy // Radio electronic computer systems. - 2008. - Vol. 6 (33). - p. 46 - 51.
[2] V. S. Glukhov, A. V. Glukhova. Results of Galois fields elements multipliers structural complexity evaluation [Text] / V. S. Glukhov, A. V. Glukhova // Proceedings of the National University "Lviv Polytechnic" "Computer systems and networks. " - Lviv: - 2013 - Vol. 773. - p. 27 - 32.
[3] V. S. Glukhov, H. M. Trishch. Multisectional Galois field elements multipliers Structural complexity Assessment [Text] / V. S. Glukhov, H. M. Trishch // Proceedings of the National University "Lviv Polytechnic" "Computer systems and networks. " - Lviv: - 2014 - Vol. 806. - p. 27 - 33.
[4] V. S. Glukhov, R. Elias. Elements of Galois fields multisection multipliers structural complexity reduction / V. S. Glukhov, R. Elias // Electrotechnical and Computer systems. - 2015. - № 19 (95) - p. 222-226.
[5] H. M. Trishch, Evaluation of Galois field GF (2m) elements Multiplier modified matrix structural complexity / H. M. Trishch // Materials XVII-th International Scientific Conference. "Modern information and electronic technologies." Odessa: - 2016 - p. 141 - 142.
[6] H. M. Trishch, Galois field GF (2m) elements Multiplier modified matrix structural complexity [Text] / H. M. Trishch // Materials of V International scientific conference "Information protection and security of information systems." - Publishing house "Lviv Polytechnic", Lviv: - 2016. - p. 80 - 81.