Systolic array implementation of Euclid's algorithm for inversion and division in GF(2/sup m/)

This paper presents a new systolic VLSI architecture for computing inverses and divisions in finite fields GF(2/sup m/) based on a variant of Euclid's algorithm. It is highly regular, modular, and thus well suited to VLSI implementation. It has O(m/sup 2/) area complexity and can produce one result per clock cycle with a latency of 8m-2 clock cycles. As compared to existing related systolic architectures with the same throughput performance, the proposed one gains a significant improvement in area complexity.

[1]  Mohammed Benaissa,et al.  GF(2^m) Multiplication and Division Over the Dual Basis , 1996, IEEE Trans. Computers.

[2]  Andreas Curiger,et al.  On Computing Multiplicative Inverses in GF(2^m) , 1993, IEEE Trans. Computers.

[3]  Shyue-Win Wei,et al.  VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/) , 1997 .

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

[5]  Kiyomichi Araki,et al.  Fast Inverters over Finite Field Based on Euclid's Algorithm , 1989 .

[6]  Chin-Liang Wang,et al.  A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2^m) , 1993, IEEE Trans. Computers.

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

[8]  Mario Kovac,et al.  SIGMA: a VLSI systolic array implementation of a Galois field GF(2 m) based multiplication and division algorithm , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[9]  Vijay K. Bhargava,et al.  Bit-Serial Systolic Divider and Multiplier for Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.

[10]  R. Blahut.  Theory and practice of error control codes , 1983 .

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

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

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

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

[15]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[16]  V. Pan,et al.  Polynomial and Matrix Computations , 1994, Progress in Theoretical Computer Science.

[17]  Shyue-Win Wei.  VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/) , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

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