Title :
Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
Author :
Fan, Haining ; Hasan, M. Anwar
Author_Institution :
Tsinghua Univ., Beijing
Abstract :
Based on a recently proposed Toeplitz matrix-vector product approach, a subquadratic computational complexity scheme is presented for multiplications in binary extended finite fields using type I and II optimal normal bases.
Keywords :
Toeplitz matrices; computational complexity; Toeplitz matrix-vector product approach; binary extended finite fields; extended binary multiplication; optimal normal bases; subquadratic computational complexity schemes; Arithmetic; Computational complexity; Computer applications; Concurrent computing; Delay; Galois fields; Polynomials; Product design; TV; Finite field; normal basis; optimal normal basis; subquadratic computational complexity multiplication;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2007.1076
