On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"
Willi Geiselmann, Jörn Müller‐Quade, Rainer Steinwandt · IEEE Transactions on Computers · 2002
For original article see G. Drolet, ibid., vol. 47, no. 9, p. 938-946, (Sept 1998). We characterize the smallest n with GF(2)[X]/(X/sup n/ + 1) containing an isomorphic copy of GF(2/sup m/). This characterization shows that the representation of finite fields described in a previous issue of the IEEE Transactions on Computers is not "optimal" as claimed. The representation considered there can often be improved significantly.