The Community for Technology Leaders
Green Image
A class of universal unidirectional bit serial systolic architectures for multiplicative inversion and division over Galois field {\rm GF}(2^m) is presented. The field elements are represented with polynomial (standard) basis. These systolic architectures have no carry propagation structures and are suitable for hardware implementations where the dimension of the field is large and may vary. This is the typical case for cryptographic applications. These architectures are independent of any defining irreducible polynomial of a given degree as well. The time complexity is constant and area complexity is linear (w.r.t. field dimension) and these measures are equivalent to or exceed similar proposed designs.
Division, extended Euclidean algorithm, finite fields, field arithmetic, inversion, systolic arrays.

M. A. Hasan and A. K. Daneshbeh, "A Class of Unidirectional Bit Serial Systolic Architectures for Multiplicative Inversion and Division over {\rm GF}(2^m)," in IEEE Transactions on Computers, vol. 54, no. , pp. 370-380, 2005.
93 ms
(Ver 3.3 (11022016))