Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases

DOI10.1109/TC.2007.1076zbMath1390.68343OpenAlexW2105427204MaRDI QIDQ4564229

Haining Fan, M. Anwarul Hasan

Publication date: 12 June 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2007.1076

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05)

Related Items (2)

Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation

This page was built for publication: Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases