By Topic

High-throughput hardware-efficient digit-serial architecture for field multiplication over GF(2m)

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
$33 $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

1 Author(s)
P. K. Meher ; School of Computer Engineering Nanyang Technological University, 639798, Singapore

It presents a novel digit-serial architecture for finite field multiplications over GF(2m) defined by irreducible trinomials as field polynomials. The critical path of the proposed structure is reduced, and a saving of m number of XOR gates is achieved by the proposed structure at the final output stage by successive finite field accumulation through T flip-flops instead of using D flip-flops and XOR gates in sequential loop. The proposed design is highly modular, and consists of regular blocks of AND and XOR logic gates. The details of hardware requirement and computational delay of the proposed multiplier have been estimated and compared with those of the existing designs. It is found that the proposed design offers considerably lower area-time complexity compared with the existing designs. The advantage of the proposed design is mainly based on its lower critical path, optimal logic design and 100% hardware utilization efficiency.

Published in:

Information, Communications & Signal Processing, 2007 6th International Conference on

Date of Conference:

10-13 Dec. 2007