High-speed polynomial basis multipliers over GF(2^m) for special pentanomials



Downloads per month over past year

Imaña Pascual, José Luis (2016) High-speed polynomial basis multipliers over GF(2^m) for special pentanomials. IEEE transactions on circuits and systems I-regular papers, 63 (1). pp. 58-69. ISSN 1549-8328

[thumbnail of imaña16postprint.pdf]

Official URL: http://dx.doi.org/10.1109/TCSI.2015.2500419


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.

Item Type:Article
Additional Information:

© 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.

Uncontrolled Keywords:Bit-parallel multipliers; Finite field; GF(2^m); Irreducible pentanomials; Polynomial basis.
Subjects:Sciences > Physics > Computers
ID Code:37238
Deposited On:20 Apr 2016 14:44
Last Modified:10 May 2019 18:14

Origin of downloads

Repository Staff Only: item control page