论文信息 - A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields

A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields

A Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic shift; hence, the multiplier contains redundancy. By removing the redundancy, a modified parallel multiplier is presented which is modular and has a lower circuit complexity. >

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

[2] Ian F. Blake,et al. Low complexity normal bases , 1989, Discret. Appl. Math..

[3] Toshiya Itoh,et al. Structure of Parallel Multipliers for a Class of Fields GF(2^m) , 1989, Inf. Comput..

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

[5] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .

[6] Vijay K. Bhargava,et al. Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.

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