The Community for Technology Leaders
Green Image
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.
INDEX TERMS
Finite field, subquadratic computational complexity multiplication, normal basis, optimal normal basis
CITATION
M. Anwar Hasan, Haining Fan, "Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases", IEEE Transactions on Computers, vol. 56, no. , pp. 1435-1437, October 2007, doi:10.1109/TC.2007.1076
105 ms
(Ver 3.1 (10032016))