Rahma, Mohammed KadhimHlukhov, Valeriy S.2018-04-102018-04-102016Rahma M. K. Time complexity of multipliers for Galois fields / Mohammed Kadhim Rahma, Valeriy S. Hlukhov // Litteris et Artibus : proceedings of the 6th International youth science forum, November 24–26, 2016, Lviv, Ukraine / Lviv Polytechnic National University. – Lviv : Lviv Polytechnic Publishing House, 2016. – P. 53–54. – Bibliography: 10 titles.https://ena.lpnu.ua/handle/ntb/40249Multipliers for binary Galois field GF (2n) hardware complexity allows to implement in FPGA an operational device with multiple multipliers. But because of large structural complexity for some combinations of large degrees n of field and the multipliers number to make it is practically impossible. One of the possible choices of this problem solving is the move to using Galois fields with the base d, greater than 2. Multipliers for such extended Galois field GF (dm) with approximately the same number of elements dm  2n are estimated in the article in terms of their time complexity to determine the fields in which the multiplier will have the least time complexity.entime complexityGalois fieldextended fieldfield characteristicdegree of the fieldmultiplierConference Abstract53-54