We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Adikari, J. ; ECE Dept., Univ. of Waterloo, Waterloo, ON, Canada ; Barsoum, A. ; Hasan, M.A. ; Namin, A.H.
more authors

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.

Published in:

Computers, IEEE Transactions on  (Volume:62 ,  Issue: 1 )