Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
Haining Fan, M.A. Hasan · IEEE Transactions on Computers · 2007
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.