High-Speed, Low-Complexity Systolic Designs of Novel Iterative Division Algorithms in GF(2^m)

We extend the binary algorithm invented by Stein and propose novel iterative division algorithms over GF(2/sup m/) for systolic VLSI realization. While algorithm EBg is a basic prototype with guaranteed convergence in at most 2m - 1 iterations, its variants, algorithms EBd and EBdf, are designed for reduced complexity and fixed critical path delay, respectively. We show that algorithms EBd and EBdf can be mapped to parallel-in parallel-out systolic circuits with low area-time complexities of O(m/sup 2/loglogm) and O(m/sup 2/), respectively. Compared to the systolic designs based on the extended Euclid's algorithm, our circuits exhibit significant speed and area advantages.

[1]  A. P. Chandrakasan,et al.  An energy-efficient reconfigurable public-key cryptography processor , 2001, IEEE J. Solid State Circuits.

[2]  M. Anwar Hasan.  Double-Basis Multiplicative Inversion Over GF(2m) , 1998, IEEE Trans. Computers.

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

[4]  J. Stein.  Computational problems associated with Racah algebra , 1967 .

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

[6]  C.-L. Wang,et al.  Hardware-efficient systolic architecture for inversion and division in GF(2m) , 1998 .

[7]  Kazuyoshi Takagi,et al.  A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis , 2001, IEEE Trans. Computers.

[8]  Chin-Liang Wang,et al.  Systolic Array Implementation o Euclid's Algorithm for Inversion and Division in GF(2m) , 1998, IEEE Trans. Computers.

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

[10]  H. T. Kung,et al.  Systolic VLSI Arrays for Polynomial GCD Computation , 1984, IEEE Transactions on Computers.

[11]  Masao Kasahara,et al.  Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields , 1989, IEEE Trans. Inf. Theory.

[12]  Naofumi Takagi,et al.  A VLSI Algorithm for Modular Division Based on the Binary GCD Algorithm(Special Section on Discrete Mathematics and Its Applications) , 1998 .

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

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

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

[16]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[17]  Kazuyoshi Takagi,et al.  A VLSI Algorithm for Division in GF(2m) Based on Extended Binary GCD Algorithm , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..