DocumentCode :
44433
Title :
schmi{GF(2^n)} Shifted Polynomial Basis Multipliers Based on Subquadratic Toeplitz Matrix-Vector Product App
Author :
Jiangtao Han ; Haining Fan
Author_Institution :
Sch. of Software, Tsinghua Univ., Beijing, China
Volume :
64
Issue :
3
fYear :
2015
fDate :
Mar-15
Firstpage :
862
Lastpage :
867
Abstract :
Besides Karatsuba´s algorithm, optimal Toeplitz matrix-vector product (TMVP) formulae is another approach to design GF(2n) subquadratic multipliers. However, when GF(2n) elements are represented using a polynomial basis or its generalization-shifted polynomial basis-this approach is currently appliable only to fields GF(2n) generated by an irreducible trinomial or a special type of irreducible pentanomials, but not to a general irreducible pentanomial. The reason is that no transformation matrix, which transforms the Mastrovito matrix into a Toeplitz matrix, has been found. In this article, we propose such a transformation matrix and its inverse matrix for an arbitrary irreducible pentanomial.
Keywords :
Toeplitz matrices; computational complexity; matrix decomposition; polynomials; vectors; GF(2n) subquadratic multipliers; GF(2n)-shifted polynomial basis multipliers; Mastrovito matrix; TMVP formulae; arbitrary irreducible pentanomial; inverse matrix; irreducible trinomial; optimal Toeplitz matrix-vector product formulae; subquadratic Toeplitz matrix-vector product approach; transformation matrix; Algorithm design and analysis; Educational institutions; Matrix converters; Polynomials; Time complexity; Vectors; Finite field; Toeplitz matrix; irreducible pentanomial; polynomial basis; subquadratic space complexity multiplier;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2013.2297106
Filename :
6698349
Link To Document :
بازگشت