RT Journal Article
T1 Fast bit-parallel binary multipliers based on type-I pentanomials
A1 Imaña Pascual, José Luis
AB In this paper, a fast implementation of bit-parallel polynomial basis (PB) multipliers over the binary extension field GF(2^m) generated by type-I irreducible pentanomials is presented. Explicit expressions for the coordinates of the multipliers and a detailed example are given. Complexity analysis shows that the multipliers here presented have the lowest delay in comparison to similar bit-parallel PB multipliers found in the literature based on this class of irreducible pentanomials. In order to prove the theoretical complexities, hardware implementations over Xilinx FPGAs have also been performed. Experimental results show that the approach here presented exhibits the lowest delay with a balanced Area x Time complexity when it is compared with similar multipliers.
PB IEEE Computer Society
SN 0018-9340
YR 2018
FD 2018-06
LK https://hdl.handle.net/20.500.14352/13330
UL https://hdl.handle.net/20.500.14352/13330
LA eng
NO ©2018 IEEE Computer SocietyThis work has been supported by the EU (FEDER) and the Spanish MINECO, under grants TIN 2015-65277-R and TIN2012-32180.
NO Ministerio de Economía y Competitividad (MINECO)/FEDER
DS Docta Complutense
RD 8 abr 2025