By Topic

Fast bit-parallel GF(2n) multiplier for all trinomials

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

2 Author(s)
Haining Fan ; Dept. of Comput. Sci., Tsinghua Univ., Beijing, China ; Yiqi Dai

Based on a new representation of GF(2n), we present two multipliers for all irreducible trinomials. Space complexities of the multipliers match the best results. The time complexity of one multiplier is TA + (1 + [log2 n])TX for all irreducible trinomials, where TA and TX are the delay of one 2-input AND and XOR gates, respectively.

Published in:

Computers, IEEE Transactions on  (Volume:54 ,  Issue: 4 )