The Community for Technology Leaders
Green Image
<p>The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier the type I optimal normal basis.</p>
Finite fields, nonconventional basis, elliptic curve, public-key cryptosystems.

C. H. Kim, S. Oh and J. Lim, "A New Hardware Architecture for Operations in GF(2m)," in IEEE Transactions on Computers, vol. 51, no. , pp. 90-92, 2002.
85 ms
(Ver 3.3 (11022016))