The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (2002 vol.51)
pp: 1460-1461
ABSTRACT
<p><b>Abstract</b>—We characterize the smallest <it>n</it> with GF (2) [X] /(X^n+1) containing an isomorphic copy of GF(2^m). This characterization shows that the representation of finite fields described in a previous issue of the <it>IEEE Transactions on Computers</it> is not "optimal" as claimed. The representation considered there can often be improved significantly.</p>
INDEX TERMS
Galois field arithmetic, VLSI implementation.
CITATION
Willi Geiselmann, Jörn Müller-Quade, Rainer Steinwandt, "On "A New Representation of Elements of Finite Fields GF (2^m) Yielding Small Complexity Arithmetic Circuits"", IEEE Transactions on Computers, vol.51, no. 12, pp. 1460-1461, December 2002, doi:10.1109/TC.2002.1146713
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool