The Community for Technology Leaders
Green Image
ABSTRACT
<p><b>Abstract</b>—Generalizing a construction of Silverman, we describe a redundant representation of finite fields GF(q<sup><font size="-1">n</font></sup>), where computations in GF (q<sup><font size="-1">n</font></sup>) are realized through computations in a suitable residue class algebra. Our focus is on fields of characteristic <tmath>\ne 2</tmath> and we show that the representation discussed here can, in particular, be used for designing a highly regular multiplication circuit for GF (q<sup><font size="-1">n</font></sup>).</p>
INDEX TERMS
Galois field arithmetic, VLSI implementation.
CITATION
Willi Geiselmann, Rainer Steinwandt, "A Redundant Representation of GF(q^n) for Designing Arithmetic Circuits", IEEE Transactions on Computers, vol. 52, no. , pp. 848-853, July 2003, doi:10.1109/TC.2003.1214334
98 ms
(Ver 3.3 (11022016))