DocumentCode
1715164
Title
Cellular automata based VLSI architecture for computing multiplication and inverses in GF(2m)
Author
Choudhury, P. Pal ; Barua, R.
Author_Institution
Comput. Sci. Unit, Indian Stat. Inst., Calcutta, India
fYear
1994
Firstpage
279
Lastpage
282
Abstract
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
Keywords
VLSI; cellular automata; combinatorial circuits; digital arithmetic; error correction codes; inverse problems; matrix algebra; parallel architectures; GF(2m) inverses; VLSI architecture; cellular automata; combinatorial design; cryptographic applications; error correcting codes; finite fields; highly parallel design; modular design; multiplication; Algorithm design and analysis; Automata; Computer architecture; Computer science; Digital circuits; Error correction codes; Galois fields; Integrated circuit interconnections; Pipelines; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI Design, 1994., Proceedings of the Seventh International Conference on
Conference_Location
Calcutta
ISSN
1063-9667
Print_ISBN
0-8186-4990-9
Type
conf
DOI
10.1109/ICVD.1994.282702
Filename
282702
Link To Document