DocumentCode :
3419222
Title :
Multiplication and inversion over a class of GF(2m)
Author :
Hasan, M.A. ; Bhargava, V.K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada
fYear :
1991
fDate :
9-10 May 1991
Firstpage :
211
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
Keywords :
matrix algebra; polynomials; GF(2m); Galois fields; field elements; finite fields; high-speed configuration; inversion; irreducible all one polynomials; matrices; multiplication; parallel multiplier; Arithmetic; Circuits; Cryptography; Educational institutions; Equations; Error correction; Galois fields; Message-oriented middleware; Polynomials; Very large scale integration;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Computers and Signal Processing, 1991., IEEE Pacific Rim Conference on
Conference_Location :
Victoria, BC
Print_ISBN :
0-87942-638-1
Type :
conf
DOI :
10.1109/PACRIM.1991.160717
Filename :
160717
Link To Document :
بازگشت