By Topic

Architectures for arithmetic 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
$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)
Barua, R. ; Div. of Stat. Math., Indian Stat. Inst., India ; Sengupta, S.

Arithmetic over finite fields has significant applications in switching theory, error-correcting codes, cryptography etc. In this article, we present several algorithms and design architectures for some of the operations over GF(2m). The architectures use one-dimensional arrays with regular and nearest-neighbour interconnections. Together with a modification of a standard basis multiplier, our designs cover array-based implementations for all these operations for both normal and standard basis. We also design a normal basis multiplier which, for many values of m, has less complicated interconnections and by achieving squaring in standard basis in one clock cycle, we establish this basis as a practicable alternative to normal basis for fast and efficient arithmetic operations over GF(2m)

Published in:

VLSI Design, 1997. Proceedings., Tenth International Conference on

Date of Conference:

4-7 Jan 1997