A redundant representation of GF(qn) for designing arithmetic circuits
Willi Geiselmann, Rainer Steinwandt · IEEE Transactions on Computers · 2003
Generalizing a construction of Silverman (1999), we describe a redundant representation of finite fields GF(qn), where computations in GF(qn) are realized through computations in a suitable residue class algebra. Our focus is on fields of characteristic ≠ 2 and we show that the representation discussed here can, in particular, be used for designing a highly regular multiplication circuit for GF qn).