MULTIPLIERS FOR GALOIS FIELDS TIME COMPLEXITY

  • Родріг Мітрі Еліас Lebanese International University
  • Валерій Сергійович Глухов Lviv Polytechnic National University
  • Мохаммед Кадім Рахма Lviv Polytechnic National University

Abstract

Multipliers for binary Galois field GF (2n
) hardware complexity allows to implement in FPGA an
operational device with multiple multipliers. But because of the large structural complexity for some combinations of
large order 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  2
n 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

Author Biographies

Родріг Мітрі Еліас, Lebanese International University

PhD, an instructor at the School of Engineering at the Lebanese International University, School of Engineering, Block G, Lebanese International University

Валерій Сергійович Глухов, Lviv Polytechnic National University

Dr. of Science, Professor, Professor of the Department of Computer Engineering, Lviv Polytechnic National University

Мохаммед Кадім Рахма, Lviv Polytechnic National University

PhD student of the Department of Computer Engineering, Lviv Polytechnic National University

Published
2016-05-31
Issue
No. 22(98) (2016): Electrotechnic and Computer Systems
Section
Information Systems and Technologies