Cellular automata based VLSI architecture for computing multiplication and inverses in GF(2/sup m/)

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(2/sup m/) 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(2/sup m/) are presented. The new design is highly parallel, modular and well-suited for VLSI implementation.<
>