The Community for Technology Leaders
RSS Icon
Issue No.02 - February (1990 vol.39)
pp: 258-262
<p>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.</p>
VLSI design; computing exponentiations; pseudorandom number sequences; finite fields; logic CAD; multiplying circuits; random number generation; VLSI.
C.C. Wang, D. Pei, "A VLSI Design for Computing Exponentiations in GF(2/sup m/) and its Application to Generate Pseudorandom Number Sequences", IEEE Transactions on Computers, vol.39, no. 2, pp. 258-262, February 1990, doi:10.1109/12.45211
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool