By Topic

Fast inverters and dividers for finite field 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
$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)
Yuh-Tsuen Horng ; Dept. of Electr. Eng., Chung-Hua Polytech. Inst., Hsin-Chu, Taiwan ; Shyue-Win Wei

Based on Euclid's algorithm, two architectures for performing rapid inversions and divisions in finite field GF(2m) with the standard basis representation are presented. Both architectures have regularity and modularity and are well suited for VLSI implementation. These circuits can be easily expanded to any finite field size because they are independent of the primitive polynomial used to generate the field. The proposed inverter and divider take exactly 2(m-1) clock cycles for each inversion and division operation, and the clock period is independent of the field size m

Published in:

Circuits and Systems, 1994. APCCAS '94., 1994 IEEE Asia-Pacific Conference on

Date of Conference:

5-8 Dec 1994