论文信息 - A VLSI DEsign for Computing Exponentiations in GF(2^m) and Its Application to Generate Pseudorandom Number Sequences

A VLSI DEsign for Computing Exponentiations in GF(2^m) and Its Application to Generate Pseudorandom Number Sequences

A VLSI design for computing exponentiation in finite fields is developed. An algorithm to generate a relatively long pseudorandom number sequence is presented. It is shown that the period of this sequence is significantly increased compared to that of the sequence generated by the most commonly used maximal length shift register scheme. >

Dingyi Pei | Charles C. Wang | Charles C. Wang | D. Pei

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

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

[3] M. Perlman. Periodic binary sequence generators: VLSI circuits considerations , 1984 .

[4] J. Kowalchuk,et al. Packets to the editor , 1979 .

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

[6] Robert C. Dixon,et al. Spread‐spectrum systems , 1976 .