RT Journal Article
T1 High-speed polynomial basis multipliers over GF(2^m) for special pentanomials
A1 Imaña Pascual, José Luis
AB Efficient hardware implementations of arithmetic operations in the Galois field GF(2^m) are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2^m) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.
PB IEEE-Inst Electrical Electronics Engineers Inc.
SN 1549-8328
YR 2016
FD 2016-01
LK https://hdl.handle.net/20.500.14352/24434
UL https://hdl.handle.net/20.500.14352/24434
LA eng
NO © 2015 IEEE.This work was supported by the Spanish Government under Research Grants CICYT TIN2008-00508 and TIN2012-32180. This paper was recommended by Associate Editor S. Ghosh.
NO Comisión Interministerial de Ciencia y Tecnología (CICYT), España
DS Docta Complutense
RD 19 dic 2025