A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2^m)

A new serial-in serial-out systolic array is presented for performing the element inversion in GF(2/sup m/) with the standard basis representation. The architecture is highly regular, modular, nearest neighbor connected, and thus well suited to VLSI implementation, It has a latency of 7m-3 clock cycles and a throughput rate of one result per 2m)-1 clock cycles. This speed performance is much better than those of the previous implementations. Without change in hardware design, the proposed inversion array can be directly used for computing the division in GF(2/sup m/). >

[1]  C.-W. Jen,et al.  The design of a systolic array system for linear state equations , 1988, [1988] Proceedings. International Conference on Systolic Arrays.

[2]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[3]  Dorothy E. Denning,et al.  Cryptography and Data Security , 1982 .

[4]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[5]  Irving S. Reed,et al.  Galois Switching Functions and Their Applications , 1975, IEEE Transactions on Computers.

[6]  C.-W. Jen,et al.  Design of a systolic array system for linear state equations , 1988 .

[7]  W. W. Peterson,et al.  Error-Correcting Codes. , 1962 .

[8]  Gui Liang Feng.  A VLSI Architecture for Fast Inversion in GF(2^m) , 1989, IEEE Trans. Computers.

[9]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[10]  Trieu-Kien Truong,et al.  VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.

[11]  H. T. Kung.  Why systolic architectures? , 1982, Computer.

[12]  George I. Davida.  Inverse of elements of a Galois field , 1972 .

[13]  Trieu-Kien Truong,et al.  The use of finite fields to compute convolutions , 1975, IEEE Trans. Inf. Theory.