By Topic

Cellular automata based VLSI architecture for computing multiplication and inverses in 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

2 Author(s)
P. Pal Choudhury ; Comput. Sci. Unit, Indian Stat. Inst., Calcutta, India ; R. Barua

Finite fields have proved to be very useful in error correcting codes, combinatorial design and many cryptographic applications. Finding multiplication of any two elements in GF(2m) and finding the inverse of an element are most difficult and time consuming operations. In this paper, new algorithms based on cellular automata operations for performing fast multiplication and inversion in GF(2m) are presented. The new design is highly parallel, modular and well-suited for VLSI implementation

Published in:

VLSI Design, 1994., Proceedings of the Seventh International Conference on

Date of Conference:

5-8 Jan 1994