Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
Jithra Adikari, Ayad F. Barsoum, M.A. Hasan, Ashkan Hosseinzadeh Namin, Christophe Négre · IEEE Transactions on Computers · 2011
In this paper, we propose new schemes for subquadratic arithmetic complexity multiplication in binary fields using optimal normal bases. The schemes are based on a recently proposed method known as block recombination, which efficiently computes the sum of two products of Toeplitz matrices and vectors. Specifically, here we take advantage of some structural properties of the matrices and vectors involved in the formulation of field multiplication using optimal normal bases. This yields new space and time complexity results for corresponding bit parallel multipliers.