Multiplication and inversion over a class of GF(2m)

TitleMultiplication and inversion over a class of GF(2m)
Publication TypeConference Paper
Year of Publication1991
AuthorsHasan, M. A., and V. K. Bhargava
Conference NameCommunications, Computers and Signal Processing, 1991., IEEE Pacific Rim Conference on
Pagination211 -214 vol.1
Date Publishedmay.
Keywordsfield elements, finite fields, Galois fields, GF(2m), high-speed configuration, inversion, irreducible all one polynomials, matrices, matrix algebra, multiplication, parallel multiplier, polynomials
Abstract

Finite fields GF(2m) generated by irreducible all one polynomials are considered. Field elements are represented by a canonical basis. For such representation, a structure for parallel multiplier is presented. The structure is modular, and suitable for VLSI implementation. Sequential computation of inverses of the field elements is also considered and a high-speed configuration is presented

URLhttp://dx.doi.org/10.1109/PACRIM.1991.160717
DOI10.1109/PACRIM.1991.160717

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia