The Community for Technology Leaders
Green Image
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.
Finite field, subquadratic computational complexity multiplication, normal basis, optimal normal basis
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
107 ms
(Ver 3.1 (10032016))