FPGA CORES FOR FAST MULTIPLICATIVE INVERSE CALCULATION IN GALOIS FIELDS

Abstract

There are two common methods for division in a Galois Field GF(2m): based on multiplication an extended Euclidean algorithm for polynomial basis and exponentiation method for normal basis. The disadvantage of the first one is the dependence of division time on the value of operands. So in the study some undependable on operand values methods based on squares and square roots calculation are tested to select ones with the best hardware and time complexity for polynomial basis. All methods were implemented as field programmable integrated circuit (FPGA) cores, their work was verified by simulation.

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

assistant of the Department of Computer Engineering, Lviv Polytechnic National University

Published
2018-06-26
How to Cite
Элиас, Р. М., Глухов, В., & Жолубак, И. (2018). FPGA CORES FOR FAST MULTIPLICATIVE INVERSE CALCULATION IN GALOIS FIELDS. Electrotechnic and Computer Systems, (27(103), 227-233. https://doi.org/10.15276/eltecs.27.103.2018.26
Section
Protection of an information in computer systems